COIN-OR::LEMON - Graph Library

Changeset 1953:d4f411003580 in lemon-0.x for doc


Ignore:
Timestamp:
02/03/06 16:58:24 (14 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2528
Message:

Polish the doc.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/graph_orientation.dox

    r1715 r1953  
    6464\until {
    6565
    66 First we check whether the program is called with exactly 1 parameter.
     66First we check whether the program is called with exactly one parameter.
    6767If it isn't, we print a short help message end exit.
    6868The vast majority of people would probably skip this block.
     
    7272Now, we read a graph \c g, and a map \c f containing
    7373the in-deg requirements from a \ref graph-io-page ".lgf (Lemon Graph Format)"
    74 file. To generate the output picture, we also read the node titles (\c id) and
     74file. To generate the output picture, we also read the node titles (\c label)
     75and
    7576coordinates (\c coords).
    7677So, first we create the graph
     
    8788\until }
    8889
    89 The algorithm needs a "level" integer value assigned to each node. In the
    90 beginning, the nodes are on level 0.
     90The algorithm needs an integer value assigned to each node. We call this "level" and the nodes are on level 0 at the
     91beginning of the execution.
     92
    9193\skipline level
    9294
     
    102104\until def
    103105
    104 We also store in a bool map indicating which edges are reverted. Actually this is only
     106We also store in a bool map indicating which edges are reverted.
     107Actually this map called \c rev is only
    105108used to draw these edges with different color in the output picture. The
    106 algorithm will update this map called \c rev, but will not use it otherwise.
     109algorithm updates this map, but will not use it otherwise.
    107110\skip rev
    108111\until reversed
     
    112115
    113116Here comes the algorithms itself.
    114 In each iteration we choose an active node (\c act will store it). If there is
     117In each iteration we choose an active node (\c act will do it for us).
     118If there is
    115119no such a node, then the orientation is feasible so we are done.
    116120\skip act
Note: See TracChangeset for help on using the changeset viewer.