equal
deleted
inserted
replaced
86 /// |
86 /// |
87 /// The elevator type used by Circulation algorithm. |
87 /// The elevator type used by Circulation algorithm. |
88 /// |
88 /// |
89 /// \sa Elevator |
89 /// \sa Elevator |
90 /// \sa LinkedElevator |
90 /// \sa LinkedElevator |
91 typedef Elevator<Graph, typename Graph::Node> Elevator; |
91 typedef lemon::Elevator<Graph, typename Graph::Node> Elevator; |
92 |
92 |
93 /// \brief Instantiates an Elevator. |
93 /// \brief Instantiates an Elevator. |
94 /// |
94 /// |
95 /// This function instantiates a \ref Elevator. |
95 /// This function instantiates a \ref Elevator. |
96 /// \param graph The graph, to which we would like to define the elevator. |
96 /// \param graph The graph, to which we would like to define the elevator. |
100 } |
100 } |
101 |
101 |
102 /// \brief The tolerance used by the algorithm |
102 /// \brief The tolerance used by the algorithm |
103 /// |
103 /// |
104 /// The tolerance used by the algorithm to handle inexact computation. |
104 /// The tolerance used by the algorithm to handle inexact computation. |
105 typedef Tolerance<Value> Tolerance; |
105 typedef lemon::Tolerance<Value> Tolerance; |
106 |
106 |
107 }; |
107 }; |
108 |
108 |
109 ///Push-relabel algorithm for the Network Circulation Problem. |
109 ///Push-relabel algorithm for the Network Circulation Problem. |
110 |
110 |