COIN-OR::LEMON - Graph Library

Changeset 1252:4fee8e9d9014 in lemon-0.x for src


Ignore:
Timestamp:
03/23/05 17:59:13 (15 years ago)
Author:
marci
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1679
Message:

documentation

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/lemon/graph_wrapper.h

    r1242 r1252  
    435435  non-negative edge-lengths. Note that
    436436  the comprehension of the presented solution
    437   need's some knowledge from elementary combinatorial optimization.
     437  need's some elementary knowledge from combinatorial optimization.
    438438
    439439  If a single shortest path is to be
    440   searched between two nodes \c s and \c t, then this can be done easily by
    441   applying the Dijkstra algorithm class. What happens, if a maximum number of
     440  searched between \c s and \c t, then this can be done easily by
     441  applying the Dijkstra algorithm. What happens, if a maximum number of
    442442  edge-disjoint shortest paths is to be computed. It can be proved that an
    443443  edge can be in a shortest path if and only if it is tight with respect to
     
    924924  /// SubBidirGraphWrapper by considering everywhere true
    925925  /// valued maps both for forward_filter and backward_filter.
    926   /// Finally, one of the most important applications of SubBidirGraphWrapper
     926  ///
     927  /// The most important application of SubBidirGraphWrapper
    927928  /// is ResGraphWrapper, which stands for the residual graph in directed
    928929  /// flow and circulation problems.
Note: See TracChangeset for help on using the changeset viewer.