lemon-0.x: comparison demo/dim_to

equal deleted inserted replaced

-:3a7c7358266d
+:53a3f1376138
 typedef Graph::Edge Edge;
 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;
 std::string typeName;
 }
 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).
 writeNode("source", s).
 writeNode("target", t).
 writeEdgeMap("cost", cost).
 run();
 } 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).
 writeNode("source", s).
 writeNode("target", t).
 run();
 } 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).
 writeNode("source", s).
 run();
 } else if (typeName == "capacitated") {
 Graph graph;
-StringMap capacity(graph);
+DoubleMap capacity(graph);
 readDimacs(is, graph, capacity);
 GraphWriter<Graph>(os, graph).
 writeEdgeMap("capacity", capacity).
 run();
 } else if (typeName == "plain") {