equal
deleted
inserted
replaced
70 /// \brief The type of the map that stores the flow values. |
70 /// \brief The type of the map that stores the flow values. |
71 /// |
71 /// |
72 /// The type of the map that stores the flow values. |
72 /// The type of the map that stores the flow values. |
73 /// It must conform to the \ref concepts::ReadWriteMap "ReadWriteMap" |
73 /// It must conform to the \ref concepts::ReadWriteMap "ReadWriteMap" |
74 /// concept. |
74 /// concept. |
|
75 #ifdef DOXYGEN |
|
76 typedef GR::ArcMap<Value> FlowMap; |
|
77 #else |
75 typedef typename Digraph::template ArcMap<Value> FlowMap; |
78 typedef typename Digraph::template ArcMap<Value> FlowMap; |
|
79 #endif |
76 |
80 |
77 /// \brief Instantiates a FlowMap. |
81 /// \brief Instantiates a FlowMap. |
78 /// |
82 /// |
79 /// This function instantiates a \ref FlowMap. |
83 /// This function instantiates a \ref FlowMap. |
80 /// \param digraph The digraph for which we would like to define |
84 /// \param digraph The digraph for which we would like to define |
85 |
89 |
86 /// \brief The elevator type used by the algorithm. |
90 /// \brief The elevator type used by the algorithm. |
87 /// |
91 /// |
88 /// The elevator type used by the algorithm. |
92 /// The elevator type used by the algorithm. |
89 /// |
93 /// |
90 /// \sa Elevator |
94 /// \sa Elevator, LinkedElevator |
91 /// \sa LinkedElevator |
95 #ifdef DOXYGEN |
|
96 typedef lemon::Elevator<GR, GR::Node> Elevator; |
|
97 #else |
92 typedef lemon::Elevator<Digraph, typename Digraph::Node> Elevator; |
98 typedef lemon::Elevator<Digraph, typename Digraph::Node> Elevator; |
|
99 #endif |
93 |
100 |
94 /// \brief Instantiates an Elevator. |
101 /// \brief Instantiates an Elevator. |
95 /// |
102 /// |
96 /// This function instantiates an \ref Elevator. |
103 /// This function instantiates an \ref Elevator. |
97 /// \param digraph The digraph for which we would like to define |
104 /// \param digraph The digraph for which we would like to define |
465 return tolerance; |
472 return tolerance; |
466 } |
473 } |
467 |
474 |
468 /// \name Execution Control |
475 /// \name Execution Control |
469 /// The simplest way to execute the algorithm is to call \ref run().\n |
476 /// The simplest way to execute the algorithm is to call \ref run().\n |
470 /// If you need more control on the initial solution or the execution, |
477 /// If you need better control on the initial solution or the execution, |
471 /// first you have to call one of the \ref init() functions, then |
478 /// you have to call one of the \ref init() functions first, then |
472 /// the \ref start() function. |
479 /// the \ref start() function. |
473 |
480 |
474 ///@{ |
481 ///@{ |
475 |
482 |
476 /// Initializes the internal data structures. |
483 /// Initializes the internal data structures. |