Changeset 642:e812963087f0 in lemon-0.x for src/work/marci/bipartite_matching_try.cc

Timestamp:

05/14/04 20:28:57 (20 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

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

Message:

To avoid confusion my old ListGraph? is can be used under name SageGraph?, work/sage_graph.h contains it.

File:

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

src/work/marci/bipartite_matching_try.cc

@@ -5 +5 @@
 #include <cstdlib>
 
-#include <list_graph.h>
+#include <sage_graph.h>
 //#include <smart_graph.h>
 //#include <dimacs.h>
@@ -41 +41 @@
 
 int main() {
-  typedef UndirListGraph Graph; 
+  typedef UndirSageGraph Graph; 
   typedef Graph::Node Node;
   typedef Graph::NodeIt NodeIt;
@@ -167 +167 @@
     max_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, max_flow);
 //  while (max_flow_test.augmentOnShortestPath()) { }
-  typedef ListGraph MutableGraph;
+  typedef SageGraph MutableGraph;
 //  while (max_flow_test.augmentOnBlockingFlow1<MutableGraph>()) {
   while (max_flow_test.augmentOnBlockingFlow2()) {