Changeset 1953:d4f411003580 in lemon-0.x for doc
- Timestamp:
- 02/03/06 16:58:24 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2528
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/graph_orientation.dox
r1715 r1953 64 64 \until { 65 65 66 First we check whether the program is called with exactly 1parameter.66 First we check whether the program is called with exactly one parameter. 67 67 If it isn't, we print a short help message end exit. 68 68 The vast majority of people would probably skip this block. … … 72 72 Now, we read a graph \c g, and a map \c f containing 73 73 the 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 74 file. To generate the output picture, we also read the node titles (\c label) 75 and 75 76 coordinates (\c coords). 76 77 So, first we create the graph … … 87 88 \until } 88 89 89 The algorithm needs a "level" integer value assigned to each node. In the 90 beginning, the nodes are on level 0. 90 The algorithm needs an integer value assigned to each node. We call this "level" and the nodes are on level 0 at the 91 beginning of the execution. 92 91 93 \skipline level 92 94 … … 102 104 \until def 103 105 104 We also store in a bool map indicating which edges are reverted. Actually this is only 106 We also store in a bool map indicating which edges are reverted. 107 Actually this map called \c rev is only 105 108 used 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.109 algorithm updates this map, but will not use it otherwise. 107 110 \skip rev 108 111 \until reversed … … 112 115 113 116 Here comes the algorithms itself. 114 In each iteration we choose an active node (\c act will store it). If there is 117 In each iteration we choose an active node (\c act will do it for us). 118 If there is 115 119 no such a node, then the orientation is feasible so we are done. 116 120 \skip act
Note: See TracChangeset
for help on using the changeset viewer.