doc/graph_orientation.dox
changeset 1946 17eb3eaad9f8
parent 1684 df3820d7989d
child 1953 d4f411003580
equal deleted inserted replaced
1:96f1df77173d 2:b4ffd5335540
    99 A node is \e active if its deficiency is positive (i.e. if it doesn't meet
    99 A node is \e active if its deficiency is positive (i.e. if it doesn't meet
   100 the degree requirement).
   100 the degree requirement).
   101 \skip active
   101 \skip active
   102 \until def
   102 \until def
   103 
   103 
   104 We also store in a bool map which edges are reverted. Actually this is only
   104 We also store in a bool map indicating which edges are reverted. Actually this is only
   105 used to draw these edges with different color in the output picture. The
   105 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.
   106 algorithm will update this map called \c rev, but will not use it otherwise.
   107 \skip rev
   107 \skip rev
   108 \until reversed
   108 \until reversed
   109 
   109