Changeset 2620:8f41a3129746 in lemon0.x for lemon/cycle_canceling.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/cycle_canceling.h
r2593 r2620 65 65 /// 66 66 /// \author Peter Kovacs 67 68 67 template < typename Graph, 69 68 typename LowerMap = typename Graph::template EdgeMap<int>, … … 99 98 /// \brief Map adaptor class for handling residual edge costs. 100 99 /// 101 /// \ref ResidualCostMap is a map adaptor class for handling 102 /// residual edge costs. 100 /// Map adaptor class for handling residual edge costs. 103 101 class ResidualCostMap : public MapBase<ResEdge, Cost> 104 102 { … … 279 277 } 280 278 281 /// \brief Set sthe flow map.282 /// 283 /// Set sthe flow map.279 /// \brief Set the flow map. 280 /// 281 /// Set the flow map. 284 282 /// 285 283 /// \return \c (*this) … … 293 291 } 294 292 295 /// \brief Set sthe potential map.296 /// 297 /// Set sthe potential map.293 /// \brief Set the potential map. 294 /// 295 /// Set the potential map. 298 296 /// 299 297 /// \return \c (*this) … … 308 306 309 307 /// \name Execution control 310 /// The only way to execute the algorithm is to call the run()311 /// function.312 308 313 309 /// @{ 314 310 315 /// \brief Run sthe algorithm.316 /// 317 /// Run sthe algorithm.311 /// \brief Run the algorithm. 312 /// 313 /// Run the algorithm. 318 314 /// 319 315 /// \param min_mean_cc Set this parameter to \c true to run the … … 330 326 /// \name Query Functions 331 327 /// The result of the algorithm can be obtained using these 332 /// functions. 333 /// \n run() must be called before using them. 328 /// functions.\n 329 /// \ref lemon::CycleCanceling::run() "run()" must be called before 330 /// using them. 334 331 335 332 /// @{ 336 333 337 /// \brief Return sa const reference to the edge map storing the334 /// \brief Return a const reference to the edge map storing the 338 335 /// found flow. 339 336 /// 340 /// Return sa const reference to the edge map storing the found flow.337 /// Return a const reference to the edge map storing the found flow. 341 338 /// 342 339 /// \pre \ref run() must be called before using this function. … … 345 342 } 346 343 347 /// \brief Return sa const reference to the node map storing the344 /// \brief Return a const reference to the node map storing the 348 345 /// found potentials (the dual solution). 349 346 /// 350 /// Return sa const reference to the node map storing the found347 /// Return a const reference to the node map storing the found 351 348 /// potentials (the dual solution). 352 349 /// … … 356 353 } 357 354 358 /// \brief Return sthe flow on the given edge.359 /// 360 /// Return sthe flow on the given edge.355 /// \brief Return the flow on the given edge. 356 /// 357 /// Return the flow on the given edge. 361 358 /// 362 359 /// \pre \ref run() must be called before using this function. … … 365 362 } 366 363 367 /// \brief Return sthe potential of the given node.368 /// 369 /// Return sthe potential of the given node.364 /// \brief Return the potential of the given node. 365 /// 366 /// Return the potential of the given node. 370 367 /// 371 368 /// \pre \ref run() must be called before using this function. … … 374 371 } 375 372 376 /// \brief Return sthe total cost of the found flow.377 /// 378 /// Return sthe total cost of the found flow. The complexity of the373 /// \brief Return the total cost of the found flow. 374 /// 375 /// Return the total cost of the found flow. The complexity of the 379 376 /// function is \f$ O(e) \f$. 380 377 /// … … 391 388 private: 392 389 393 /// Initialize sthe algorithm.390 /// Initialize the algorithm. 394 391 bool init() { 395 392 if (!_valid_supply) return false; … … 429 426 } 430 427 431 /// \brief Execute sthe algorithm using \ref BellmanFord.432 /// 433 /// Execute sthe algorithm using the \ref BellmanFord428 /// \brief Execute the algorithm using \ref BellmanFord. 429 /// 430 /// Execute the algorithm using the \ref BellmanFord 434 431 /// "BellmanFord" algorithm for negative cycle detection with 435 432 /// successively larger limit for the number of iterations. … … 507 504 } 508 505 509 /// \brief Execute sthe algorithm using \ref MinMeanCycle.510 /// 511 /// Execute sthe algorithm using \ref MinMeanCycle for negative506 /// \brief Execute the algorithm using \ref MinMeanCycle. 507 /// 508 /// Execute the algorithm using \ref MinMeanCycle for negative 512 509 /// cycle detection. 513 510 void startMinMean() {
Note: See TracChangeset
for help on using the changeset viewer.