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

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/cost_scaling.h
r2588 r2620 65 65 /// 66 66 /// \author Peter Kovacs 67 68 67 template < typename Graph, 69 68 typename LowerMap = typename Graph::template EdgeMap<int>, … … 103 102 /// \brief Map adaptor class for handling residual edge costs. 104 103 /// 105 /// \ref ResidualCostMap is a map adaptor class for handling 106 /// residual edge costs. 104 /// Map adaptor class for handling residual edge costs. 107 105 template <typename Map> 108 106 class ResidualCostMap : public MapBase<ResEdge, typename Map::Value> … … 127 125 /// \brief Map adaptor class for handling reduced edge costs. 128 126 /// 129 /// \ref ReducedCostMap is a map adaptor class for handling reduced 130 /// edge costs. 127 /// Map adaptor class for handling reduced edge costs. 131 128 class ReducedCostMap : public MapBase<Edge, LCost> 132 129 { … … 327 324 } 328 325 329 /// \brief Set sthe flow map.330 /// 331 /// Set sthe flow map.326 /// \brief Set the flow map. 327 /// 328 /// Set the flow map. 332 329 /// 333 330 /// \return \c (*this) … … 341 338 } 342 339 343 /// \brief Set sthe potential map.344 /// 345 /// Set sthe potential map.340 /// \brief Set the potential map. 341 /// 342 /// Set the potential map. 346 343 /// 347 344 /// \return \c (*this) … … 356 353 357 354 /// \name Execution control 358 /// The only way to execute the algorithm is to call the run()359 /// function.360 355 361 356 /// @{ 362 357 363 /// \brief Run sthe algorithm.364 /// 365 /// Run sthe algorithm.358 /// \brief Run the algorithm. 359 /// 360 /// Run the algorithm. 366 361 /// 367 362 /// \return \c true if a feasible flow can be found. … … 374 369 /// \name Query Functions 375 370 /// The result of the algorithm can be obtained using these 376 /// functions. 377 /// \n run() must be called before using them. 371 /// functions.\n 372 /// \ref lemon::CostScaling::run() "run()" must be called before 373 /// using them. 378 374 379 375 /// @{ 380 376 381 /// \brief Return sa const reference to the edge map storing the377 /// \brief Return a const reference to the edge map storing the 382 378 /// found flow. 383 379 /// 384 /// Return sa const reference to the edge map storing the found flow.380 /// Return a const reference to the edge map storing the found flow. 385 381 /// 386 382 /// \pre \ref run() must be called before using this function. … … 389 385 } 390 386 391 /// \brief Return sa const reference to the node map storing the387 /// \brief Return a const reference to the node map storing the 392 388 /// found potentials (the dual solution). 393 389 /// 394 /// Return sa const reference to the node map storing the found390 /// Return a const reference to the node map storing the found 395 391 /// potentials (the dual solution). 396 392 /// … … 400 396 } 401 397 402 /// \brief Return sthe flow on the given edge.403 /// 404 /// Return sthe flow on the given edge.398 /// \brief Return the flow on the given edge. 399 /// 400 /// Return the flow on the given edge. 405 401 /// 406 402 /// \pre \ref run() must be called before using this function. … … 409 405 } 410 406 411 /// \brief Return sthe potential of the given node.412 /// 413 /// Return sthe potential of the given node.407 /// \brief Return the potential of the given node. 408 /// 409 /// Return the potential of the given node. 414 410 /// 415 411 /// \pre \ref run() must be called before using this function. … … 418 414 } 419 415 420 /// \brief Return sthe total cost of the found flow.421 /// 422 /// Return sthe total cost of the found flow. The complexity of the416 /// \brief Return the total cost of the found flow. 417 /// 418 /// Return the total cost of the found flow. The complexity of the 423 419 /// function is \f$ O(e) \f$. 424 420 /// … … 435 431 private: 436 432 437 /// Initialize sthe algorithm.433 /// Initialize the algorithm. 438 434 bool init() { 439 435 if (!_valid_supply) return false; … … 470 466 471 467 472 /// Execute sthe algorithm.468 /// Execute the algorithm. 473 469 bool start() { 474 470 std::deque<Node> active_nodes;
Note: See TracChangeset
for help on using the changeset viewer.