Changeset 552:83c22ca968d8 in lemon-0.x for src/work

Timestamp:

05/06/04 17:24:42 (21 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

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

Message:

top-sort, for fezso's sake

Location:

src/work/marci

Files:

• bfs_dfs_misc.h (modified) (1 diff)
• top_sort.dim (modified) (1 diff)
• top_sort_test.cc (modified) (2 diffs)

src/work/marci/bfs_dfs_misc.h

@@ -51 +51 @@
         dfs.pushAndSetReached(n);
         while (!dfs.finished()) {
+          ++dfs;
           if (dfs.isANodeExamined()) {
             l.push_back(dfs.aNode());
           }
-          ++dfs;
         }
       }

src/work/marci/top_sort.dim

@@ -1 @@
-p mat 5 4
+p mat 5 5
 a 1 3
 a 2 3
 a 3 5
 a 3 4
+a 5 4

src/work/marci/top_sort_test.cc

@@ -7 +7 @@
 #include <bfs_dfs_misc.h>
 #include <list_graph.h>
+#include <graph_wrapper.h>
 
 using namespace hugo;
@@ -13 +14 @@
   typedef ListGraph Graph;
   Graph g;
-  readDimacs(std::cin, g);
-  std::list<Graph::Node> l;
-  topSort(g, l);
-  std::cout << "Leaving order of dfs which is pretopological..." << std::endl;
-  for(std::list<Graph::Node>::const_iterator i=l.begin(); i!=l.end(); ++i) {
-    std::cout << *i << " ";
+  readDimacs(std::cin, g); 
+  {
+    std::list<Graph::Node> l;
+    topSort(g, l);
+    std::cout << "Leaving order of dfs which is pretopological..." << std::endl;
+    for(std::list<Graph::Node>::const_iterator i=l.begin(); i!=l.end(); ++i) {
+      std::cout << *i << " ";
+    }
+    std::cout << std::endl;
   }
-  std::cout << std::endl;
+  
+  {
+    typedef RevGraphWrapper<Graph> GW;
+    GW gw(g);
+    std::list<GW::Node> l;
+    topSort(gw, l);
+    std::cout << "Same in the revered oriented graph..." << std::endl;
+    for(std::list<GW::Node>::const_iterator i=l.begin(); i!=l.end(); ++i) {
+      std::cout << *i << " ";
+    }
+    std::cout << std::endl;
+  }
 
   return 0;