[Lemon-commits] [lemon_svn] deba: r2335 - hugo/trunk/demo

Lemon SVN svn at lemon.cs.elte.hu
Mon Nov 6 20:51:53 CET 2006


Author: deba
Date: Mon Nov 14 19:55:19 2005
New Revision: 2335

Modified:
   hugo/trunk/demo/dim_to_lgf.cc

Log:
String->Double



Modified: hugo/trunk/demo/dim_to_lgf.cc
==============================================================================
--- hugo/trunk/demo/dim_to_lgf.cc	(original)
+++ hugo/trunk/demo/dim_to_lgf.cc	Mon Nov 14 19:55:19 2005
@@ -65,7 +65,7 @@
   typedef Graph::Node Node;
   typedef Graph::EdgeIt EdgeIt;
   typedef Graph::NodeIt NodeIt;
-  typedef Graph::EdgeMap<string> StringMap;
+  typedef Graph::EdgeMap<double> DoubleMap;
 
   std::string inputName;
   std::string outputName;
@@ -159,7 +159,7 @@
   if (typeName == "mincostflow") {
     Graph graph;
     Node s, t;
-    StringMap cost(graph), capacity(graph);
+    DoubleMap cost(graph), capacity(graph);
     readDimacs(is, graph, capacity, s, t, cost);
     GraphWriter<Graph>(os, graph).
       writeEdgeMap("capacity", capacity).
@@ -170,7 +170,7 @@
   } else if (typeName == "maxflow") {
     Graph graph;
     Node s, t;
-    StringMap capacity(graph);
+    DoubleMap capacity(graph);
     readDimacs(is, graph, capacity, s, t);
     GraphWriter<Graph>(os, graph).
       writeEdgeMap("capacity", capacity).
@@ -180,7 +180,7 @@
   } else if (typeName == "shortestpath") {
     Graph graph;
     Node s;
-    StringMap capacity(graph);
+    DoubleMap capacity(graph);
     readDimacs(is, graph, capacity, s);
     GraphWriter<Graph>(os, graph).
       writeEdgeMap("capacity", capacity).
@@ -188,7 +188,7 @@
       run();
   } else if (typeName == "capacitated") {
     Graph graph;
-    StringMap capacity(graph);
+    DoubleMap capacity(graph);
     readDimacs(is, graph, capacity);
     GraphWriter<Graph>(os, graph).
       writeEdgeMap("capacity", capacity).



More information about the Lemon-commits mailing list