equal
deleted
inserted
replaced
132 A node is \e active if its deficiency is positive (i.e. if it doesn't meet |
132 A node is \e active if its deficiency is positive (i.e. if it doesn't meet |
133 the degree requirement). |
133 the degree requirement). |
134 \skip active |
134 \skip active |
135 \until def |
135 \until def |
136 |
136 |
137 We also store in a bool map indicating which edges are reverted. |
137 We also store a bool map indicating which edges are reverted. |
138 Actually this map called \c rev is only |
138 Actually this map called \c rev is only |
139 used to draw these edges with different color in the output picture. The |
139 used to draw these edges with different color in the output picture. The |
140 algorithm updates this map, but will not use it otherwise. |
140 algorithm updates this map, but will not use it otherwise. |
141 \skip rev |
141 \skip rev |
142 \until reversed |
142 \until reversed |
165 We also have to update the maps \c def and |
165 We also have to update the maps \c def and |
166 \c rev. |
166 \c rev. |
167 \skipline if |
167 \skipline if |
168 \skip if |
168 \skip if |
169 \until } |
169 \until } |
170 Otherwise (i.e. if there is no edge stepping down one level). We lift up the |
170 Otherwise (i.e. if there is no edge stepping down one level) we lift up the |
171 current active node \c act. If it reaches level \c nodeNum, then there |
171 current active node \c act. If it reaches level \c nodeNum, then there |
172 exists no appropriate orientation so we stop. |
172 exists no appropriate orientation so we stop. |
173 \skipline else |
173 \skipline else |
174 \skipline if |
174 \skipline if |
175 \skipline return |
175 \skipline return |