1.1 --- a/demo/dim_to_lgf.cc	Mon Nov 14 18:40:15 2005 +0000
     1.2 +++ b/demo/dim_to_lgf.cc	Mon Nov 14 18:55:19 2005 +0000
     1.3 @@ -65,7 +65,7 @@
     1.4    typedef Graph::Node Node;
     1.5    typedef Graph::EdgeIt EdgeIt;
     1.6    typedef Graph::NodeIt NodeIt;
     1.7 -  typedef Graph::EdgeMap<string> StringMap;
     1.8 +  typedef Graph::EdgeMap<double> DoubleMap;
     1.9  
    1.10    std::string inputName;
    1.11    std::string outputName;
    1.12 @@ -159,7 +159,7 @@
    1.13    if (typeName == "mincostflow") {
    1.14      Graph graph;
    1.15      Node s, t;
    1.16 -    StringMap cost(graph), capacity(graph);
    1.17 +    DoubleMap cost(graph), capacity(graph);
    1.18      readDimacs(is, graph, capacity, s, t, cost);
    1.19      GraphWriter<Graph>(os, graph).
    1.20        writeEdgeMap("capacity", capacity).
    1.21 @@ -170,7 +170,7 @@
    1.22    } else if (typeName == "maxflow") {
    1.23      Graph graph;
    1.24      Node s, t;
    1.25 -    StringMap capacity(graph);
    1.26 +    DoubleMap capacity(graph);
    1.27      readDimacs(is, graph, capacity, s, t);
    1.28      GraphWriter<Graph>(os, graph).
    1.29        writeEdgeMap("capacity", capacity).
    1.30 @@ -180,7 +180,7 @@
    1.31    } else if (typeName == "shortestpath") {
    1.32      Graph graph;
    1.33      Node s;
    1.34 -    StringMap capacity(graph);
    1.35 +    DoubleMap capacity(graph);
    1.36      readDimacs(is, graph, capacity, s);
    1.37      GraphWriter<Graph>(os, graph).
    1.38        writeEdgeMap("capacity", capacity).
    1.39 @@ -188,7 +188,7 @@
    1.40        run();
    1.41    } else if (typeName == "capacitated") {
    1.42      Graph graph;
    1.43 -    StringMap capacity(graph);
    1.44 +    DoubleMap capacity(graph);
    1.45      readDimacs(is, graph, capacity);
    1.46      GraphWriter<Graph>(os, graph).
    1.47        writeEdgeMap("capacity", capacity).