equal
deleted
inserted
replaced
72 def = subMap(f,InDegMap<ListGraph>(g)); |
72 def = subMap(f,InDegMap<ListGraph>(g)); |
73 |
73 |
74 IterableBoolMap<ListGraph, Node> active(g,false); |
74 IterableBoolMap<ListGraph, Node> active(g,false); |
75 for(NodeIt n(g);n!=INVALID;++n) active[n]=(def[n]>0); |
75 for(NodeIt n(g);n!=INVALID;++n) active[n]=(def[n]>0); |
76 |
76 |
77 ListGraph::EdgeMap<bool> rev(g,false); // rev[e]==true <=> e is be |
77 ListGraph::EdgeMap<bool> rev(g,false); // rev[e]==true <=> e is to be |
78 // reversed |
78 // reversed |
79 |
79 |
80 int nodeNum=countNodes(g); |
80 int nodeNum=countNodes(g); |
81 |
81 |
82 Node act; |
82 Node act; |