An unnecessary duplicate removed.
6 #include <lemon/dimacs.h>
7 #include <bfs_dfs_misc.h>
8 #include <sage_graph.h>
9 #include <lemon/graph_wrapper.h>
10 #include <lemon/maps.h>
11 #include <for_each_macros.h>
13 using namespace lemon;
19 typedef SageGraph Graph;
21 readDimacs(std::cin, g);
24 std::list<Graph::Node> l;
25 //NullMap<Graph::Node, Graph::Edge> pred;
26 Graph::NodeMap<Graph::Edge> pred(g, INVALID);
28 cout << "Leaving order of dfs which is pretopological..." << endl;
29 for(std::list<Graph::Node>::const_iterator i=l.begin(); i!=l.end(); ++i) {
34 FOR_EACH_LOC(Graph::NodeIt, n, g) {
35 cout << "pred of node " << n << " is " << pred[n] << endl;
40 typedef RevGraphWrapper<Graph> GW;
42 std::list<GW::Node> l;
43 //NullMap<GW::Node, GW::Edge> pred;
44 GW::NodeMap<Graph::Edge> pred(gw, INVALID);
46 cout << "Same in the reversed oriented graph..." << endl;
47 for(std::list<GW::Node>::const_iterator i=l.begin(); i!=l.end(); ++i) {
52 FOR_EACH_LOC(GW::NodeIt, n, gw) {
53 cout << "pred of node " << n << " is " << pred[n] << endl;