COIN-OR::LEMON - Graph Library

Changeset 2158:0b620ff10e7c in lemon-0.x


Ignore:
Timestamp:
07/20/06 16:12:01 (13 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2873
Message:

Minor doc improvement

Files:
2 edited

Legend:

Unmodified
Added
Removed
  • demo/graph_orientation.cc

    r1956 r2158  
    7575  for(NodeIt n(g);n!=INVALID;++n) active[n]=(def[n]>0);
    7676 
    77   ListGraph::EdgeMap<bool> rev(g,false); // rev[e]==true <=> e is be
     77  ListGraph::EdgeMap<bool> rev(g,false); // rev[e]==true <=> e is to be
    7878                                         //                  reversed
    7979
  • doc/graph_orientation.dox

    r1953 r2158  
    1212The input of the problem is a(n undirected) graph and an integer value
    1313<i>f(n)</i> assigned to each node \e n. The task is to find an orientation
    14 of the edges for which the number of edge arriving to each node \e n is at
     14of the edges for which the number of edge arriving at each node \e n is at
    1515least least <i>f(n)</i>.
    1616
     
    114114\skipline nodeNum
    115115
    116 Here comes the algorithms itself.
     116Here comes the algorithm itself.
    117117In each iteration we choose an active node (\c act will do it for us).
    118118If there is
     
    121121\until while
    122122
    123 Then we check if there exists an edge leaving this node that steps down exactly
     123Then we check if there exists an edge leaving this node and
     124stepping down exactly
    124125one level.
    125126\skip OutEdge
Note: See TracChangeset for help on using the changeset viewer.