equal
deleted
inserted
replaced
117 for(EdgeIt e(G);G.valid(e);G.next(e)) {map[e]=b;b=!b;} |
117 for(EdgeIt e(G);G.valid(e);G.next(e)) {map[e]=b;b=!b;} |
118 |
118 |
119 std::cout << true << '\n'; |
119 std::cout << true << '\n'; |
120 |
120 |
121 for(EdgeIt e(G);G.valid(e);G.next(e)) |
121 for(EdgeIt e(G);G.valid(e);G.next(e)) |
122 std::cout << G.id(G.tail(e)) << "->" << G.id(G.head(e)) |
122 std::cout << G.id(G.source(e)) << "->" << G.id(G.target(e)) |
123 << ": " << map[e] << '\n'; |
123 << ": " << map[e] << '\n'; |
124 std::cout << "True Edges:\n"; |
124 std::cout << "True Edges:\n"; |
125 for(BoolIterEdgeMap<Graph>::TrueIterator i(map);i;++i) |
125 for(BoolIterEdgeMap<Graph>::TrueIterator i(map);i;++i) |
126 std::cout << G.id(G.tail(i)) << "->" << G.id(G.head(i)) << '\n'; |
126 std::cout << G.id(G.source(i)) << "->" << G.id(G.target(i)) << '\n'; |
127 std::cout << "False Edges:\n"; |
127 std::cout << "False Edges:\n"; |
128 for(BoolIterEdgeMap<Graph>::FalseIterator i(map);i;++i) |
128 for(BoolIterEdgeMap<Graph>::FalseIterator i(map);i;++i) |
129 std::cout << G.id(G.tail(i)) << "->" << G.id(G.head(i)) << '\n'; |
129 std::cout << G.id(G.source(i)) << "->" << G.id(G.target(i)) << '\n'; |
130 } |
130 } |
131 |
131 |