Changeset 607:327f7cf13843 in lemon-0.x for src/work/athos/minlength_demo.cc

Timestamp:

05/11/04 17:42:11 (20 years ago)

Author:

athos

Branch:

default

Phase:

public

Convert:

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

Message:

Finished MinLengthPaths?: a specialization of MinCostFlows?.

File:

• src/work/athos/minlength_demo.cc (modified) (3 diffs)

src/work/athos/minlength_demo.cc

@@ -3 +3 @@
 
 #include <list_graph.h>
-#include <dimacs.h>
-#include <minlengthpaths.h>
+#include <hugo/dimacs.h>
+#include <hugo/time_measure.h>
+#include "minlengthpaths.h"
 //#include <time_measure.h>
 
@@ -20 +21 @@
   Node s, t;
   Graph::EdgeMap<int> cap(G);
-  readDimacsMaxFlow(std::cin, G, s, t, cap);
+  readDimacs(std::cin, G, cap, s, t);
 
-  std::cout << "preflow demo (ATHOS)..." << std::endl;
+  std::cout << "Minlengthpaths demo (ATHOS)..." << std::endl;
   //Graph::EdgeMap<int> flow(G); //0 flow
 
@@ -32 +33 @@
   MinLengthPaths<Graph, Graph::EdgeMap<int> >
     surb_test(G,cap);
-  std::cout << surb_test.run(s,t,k) << std::endl;
-  std::cout << surb_test.totalLength() << std::endl;
+  Timer ts;
+  ts.reset();
+  std::cout << "Number of found paths: " << surb_test.run(s,t,k) << std::endl;
+  std::cout << "elapsed time: " << ts << std::endl;
+  
+  std::cout << "Total length of found paths: " << surb_test.totalLength() << std::endl;
+  //std::cout << (surb_test.checkComplementarySlackness() ? "OK (compl. slackn.)." : "Problem (compl. slackn.)!!!") << std::endl;
+
   //preflow_push<Graph, int> max_flow_test(G, s, t, cap);
   //int flow_value=max_flow_test.run();