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

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

Polish the doc.

File:
1 edited

Unmodified
Added
Removed
• ## doc/graph_orientation.dox

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