# HG changeset patch
# User deba
# Date 1131994519 0
# Node ID 79397d64f74270fecbdabf5bdf165398ee5068f7
# Parent  d8130458dd86e424260278ee004cc3b4b8535327
String->Double

diff -r d8130458dd86 -r 79397d64f742 demo/dim_to_lgf.cc
--- a/demo/dim_to_lgf.cc	Mon Nov 14 18:40:15 2005 +0000
+++ b/demo/dim_to_lgf.cc	Mon Nov 14 18:55:19 2005 +0000
@@ -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).