Changeset 2620:8f41a3129746 in lemon0.x for lemon/min_cost_max_flow.h
 Timestamp:
 10/05/08 15:37:17 (11 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@3505
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/min_cost_max_flow.h
r2587 r2620 59 59 /// 60 60 /// \author Peter Kovacs 61 62 61 template < typename Graph, 63 62 typename CapacityMap = typename Graph::template EdgeMap<int>, … … 128 127 } 129 128 130 /// \brief Set sthe flow map.131 /// 132 /// Set sthe flow map.129 /// \brief Set the flow map. 130 /// 131 /// Set the flow map. 133 132 /// 134 133 /// \return \c (*this) … … 142 141 } 143 142 144 /// \brief Set sthe potential map.145 /// 146 /// Set sthe potential map.143 /// \brief Set the potential map. 144 /// 145 /// Set the potential map. 147 146 /// 148 147 /// \return \c (*this) … … 157 156 158 157 /// \name Execution control 159 /// The only way to execute the algorithm is to call the run()160 /// function.161 158 162 159 /// @{ 163 160 164 /// \brief Run sthe algorithm.165 /// 166 /// Run sthe algorithm.161 /// \brief Run the algorithm. 162 /// 163 /// Run the algorithm. 167 164 void run() { 168 165 // Initializing maps … … 187 184 188 185 /// \name Query Functions 189 /// The result of the algorithm can be obtained using these 190 /// functions. 191 /// \n run() must be called before using them. 186 /// The results of the algorithm can be obtained using these 187 /// functions.\n 188 /// \ref lemon::MinCostMaxFlow::run() "run()" must be called before 189 /// using them. 192 190 193 191 /// @{ 194 192 195 /// \brief Return sa const reference to the edge map storing the193 /// \brief Return a const reference to the edge map storing the 196 194 /// found flow. 197 195 /// 198 /// Return sa const reference to the edge map storing the found flow.196 /// Return a const reference to the edge map storing the found flow. 199 197 /// 200 198 /// \pre \ref run() must be called before using this function. … … 203 201 } 204 202 205 /// \brief Return sa const reference to the node map storing the203 /// \brief Return a const reference to the node map storing the 206 204 /// found potentials (the dual solution). 207 205 /// 208 /// Return sa const reference to the node map storing the found206 /// Return a const reference to the node map storing the found 209 207 /// potentials (the dual solution). 210 208 /// … … 214 212 } 215 213 216 /// \brief Return sthe flow on the given edge.217 /// 218 /// Return sthe flow on the given edge.214 /// \brief Return the flow on the given edge. 215 /// 216 /// Return the flow on the given edge. 219 217 /// 220 218 /// \pre \ref run() must be called before using this function. … … 223 221 } 224 222 225 /// \brief Return sthe potential of the given node.226 /// 227 /// Return sthe potential of the given node.223 /// \brief Return the potential of the given node. 224 /// 225 /// Return the potential of the given node. 228 226 /// 229 227 /// \pre \ref run() must be called before using this function. … … 232 230 } 233 231 234 /// \brief Return sthe total cost of the found flow.235 /// 236 /// Return sthe total cost of the found flow. The complexity of the232 /// \brief Return the total cost of the found flow. 233 /// 234 /// Return the total cost of the found flow. The complexity of the 237 235 /// function is \f$ O(e) \f$. 238 236 ///
Note: See TracChangeset
for help on using the changeset viewer.