equal
deleted
inserted
replaced
50 |
50 |
51 /// \brief The type of the map that stores the flow values. |
51 /// \brief The type of the map that stores the flow values. |
52 /// |
52 /// |
53 /// The type of the map that stores the flow values. |
53 /// The type of the map that stores the flow values. |
54 /// It must meet the \ref concepts::ReadWriteMap "ReadWriteMap" concept. |
54 /// It must meet the \ref concepts::ReadWriteMap "ReadWriteMap" concept. |
|
55 #ifdef DOXYGEN |
|
56 typedef GR::ArcMap<Value> FlowMap; |
|
57 #else |
55 typedef typename Digraph::template ArcMap<Value> FlowMap; |
58 typedef typename Digraph::template ArcMap<Value> FlowMap; |
|
59 #endif |
56 |
60 |
57 /// \brief Instantiates a FlowMap. |
61 /// \brief Instantiates a FlowMap. |
58 /// |
62 /// |
59 /// This function instantiates a \ref FlowMap. |
63 /// This function instantiates a \ref FlowMap. |
60 /// \param digraph The digraph for which we would like to define |
64 /// \param digraph The digraph for which we would like to define |
65 |
69 |
66 /// \brief The elevator type used by Preflow algorithm. |
70 /// \brief The elevator type used by Preflow algorithm. |
67 /// |
71 /// |
68 /// The elevator type used by Preflow algorithm. |
72 /// The elevator type used by Preflow algorithm. |
69 /// |
73 /// |
70 /// \sa Elevator |
74 /// \sa Elevator, LinkedElevator |
71 /// \sa LinkedElevator |
75 #ifdef DOXYGEN |
72 typedef LinkedElevator<Digraph, typename Digraph::Node> Elevator; |
76 typedef lemon::Elevator<GR, GR::Node> Elevator; |
|
77 #else |
|
78 typedef lemon::Elevator<Digraph, typename Digraph::Node> Elevator; |
|
79 #endif |
73 |
80 |
74 /// \brief Instantiates an Elevator. |
81 /// \brief Instantiates an Elevator. |
75 /// |
82 /// |
76 /// This function instantiates an \ref Elevator. |
83 /// This function instantiates an \ref Elevator. |
77 /// \param digraph The digraph for which we would like to define |
84 /// \param digraph The digraph for which we would like to define |
387 } |
394 } |
388 |
395 |
389 /// \name Execution Control |
396 /// \name Execution Control |
390 /// The simplest way to execute the preflow algorithm is to use |
397 /// The simplest way to execute the preflow algorithm is to use |
391 /// \ref run() or \ref runMinCut().\n |
398 /// \ref run() or \ref runMinCut().\n |
392 /// If you need more control on the initial solution or the execution, |
399 /// If you need better control on the initial solution or the execution, |
393 /// first you have to call one of the \ref init() functions, then |
400 /// you have to call one of the \ref init() functions first, then |
394 /// \ref startFirstPhase() and if you need it \ref startSecondPhase(). |
401 /// \ref startFirstPhase() and if you need it \ref startSecondPhase(). |
395 |
402 |
396 ///@{ |
403 ///@{ |
397 |
404 |
398 /// \brief Initializes the internal data structures. |
405 /// \brief Initializes the internal data structures. |