Changeset 609:0566ac97809b in lemon-0.x for src/work/marci/top_sort_test.cc

Timestamp:

05/11/04 17:54:00 (20 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@791

Message:

misc

File:

• src/work/marci/top_sort_test.cc (modified) (3 diffs)

src/work/marci/top_sort_test.cc

@@ -9 +9 @@
 #include <hugo/graph_wrapper.h>
 #include <hugo/maps.h>
+#include <for_each_macros.h>
 
 using namespace hugo;
+
+using std::cout;
+using std::endl;
 
 int main() {
@@ -16 +20 @@
   Graph g;
   readDimacs(std::cin, g); 
+ 
   {
     std::list<Graph::Node> l;
-    NullMap<Graph::Node, Graph::Edge> pred;
+    //NullMap<Graph::Node, Graph::Edge> pred;
+    Graph::NodeMap<Graph::Edge> pred(g, INVALID);
     topSort(g, l, pred);
-    std::cout << "Leaving order of dfs which is pretopological..." << std::endl;
+    cout << "Leaving order of dfs which is pretopological..." << endl;
     for(std::list<Graph::Node>::const_iterator i=l.begin(); i!=l.end(); ++i) {
-      std::cout << *i << " ";
+      cout << *i << " ";
     }
-    std::cout << std::endl;
+    cout << endl;
+    
+    FOR_EACH_LOC(Graph::NodeIt, n, g) {
+      cout << "pred of node " << n << " is " << pred[n] << endl;
+    }
   }
   
@@ -31 +41 @@
     GW gw(g);
     std::list<GW::Node> l;
-    NullMap<GW::Node, GW::Edge> pred;
+    //NullMap<GW::Node, GW::Edge> pred;
+    GW::NodeMap<Graph::Edge> pred(gw, INVALID);
     topSort(gw, l, pred);
-    std::cout << "Same in the revered oriented graph..." << std::endl;
+    cout << "Same in the reversed oriented graph..." << endl;
     for(std::list<GW::Node>::const_iterator i=l.begin(); i!=l.end(); ++i) {
-      std::cout << *i << " ";
+      cout << *i << " ";
     }
-    std::cout << std::endl;
+    cout << endl;
+
+    FOR_EACH_LOC(GW::NodeIt, n, gw) {
+      cout << "pred of node " << n << " is " << pred[n] << endl;
+    }
   }