Changeset 1208:f486d30e4e7b in lemon-0.x for src/lemon/graph_writer.h

Timestamp:

03/09/05 15:15:22 (19 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

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

Message:

Easy input-output function for common graphs.
Modified Exception handling in graph_reader.

File:

• src/lemon/graph_writer.h (modified) (3 diffs)

src/lemon/graph_writer.h

@@ -28 +28 @@
 #include <memory>
 
+#include <lemon/map_utils.h>
 #include <lemon/invalid.h>
 #include <lemon/error.h>
@@ -163 +164 @@
     /// it constructs the given map and it use the given writer as the
     /// default skipper.
-    GraphWriter(std::ostream& _os, Graph& _graph) : os(_os), graph(_graph) {}
+    GraphWriter(std::ostream& _os, const Graph& _graph) 
+      : os(_os), graph(_graph) {}
 
 
@@ -368 +370 @@
 
     std::ostream& os;
-    Graph& graph;
+    const Graph& graph;
 
   };
 
+  /// Ready to use writer function.  
+  template<typename Graph, typename CapacityMap, typename CostMap>
+  void writeGraph(std::ostream& os, const Graph &g, 
+                  const CapacityMap& capacity, const typename Graph::Node &s,
+                  const typename Graph::Node &t, const CostMap& cost) {
+    GraphWriter<Graph> reader(os, g);
+    IdMap<Graph, typename Graph::Node> nodeIdMap(g);
+    reader.addNodeMap("id", nodeIdMap);
+    IdMap<Graph, typename Graph::Edge> edgeIdMap(g);
+    reader.addEdgeMap("id", edgeIdMap);
+    reader.addEdgeMap("capacity", capacity);
+    reader.addEdgeMap("cost", cost);
+    reader.addNode("source", s);
+    reader.addNode("target", t);
+    reader.run();
+  }
+
+  /// Ready to use writer function.  
+  template<typename Graph, typename CapacityMap, typename CostMap>
+  void writeGraph(std::ostream& os, const Graph &g, 
+                  const CapacityMap& capacity, const typename Graph::Node &s,
+                  const typename Graph::Node &t) {
+    GraphWriter<Graph> reader(os, g);
+    IdMap<Graph, typename Graph::Node> nodeIdMap(g);
+    reader.addNodeMap("id", nodeIdMap);
+    IdMap<Graph, typename Graph::Edge> edgeIdMap(g);
+    reader.addEdgeMap("id", edgeIdMap);
+    reader.addEdgeMap("capacity", capacity);
+    reader.addNode("source", s);
+    reader.addNode("target", t);
+    reader.run();
+  }
+
+  /// Ready to use writer function.  
+  template<typename Graph, typename CapacityMap>
+  void writeGraph(std::ostream& os, const Graph &g, 
+                  const CapacityMap& capacity, const typename Graph::Node &s) {
+    GraphWriter<Graph> reader(os, g);
+    IdMap<Graph, typename Graph::Node> nodeIdMap(g);
+    reader.addNodeMap("id", nodeIdMap);
+    IdMap<Graph, typename Graph::Edge> edgeIdMap(g);
+    reader.addEdgeMap("id", edgeIdMap);
+    reader.addEdgeMap("capacity", capacity);
+    reader.addNode("source", s);
+    reader.run();
+  }
+  /// Ready to use writer function.  
+  template<typename Graph, typename CapacityMap>
+  void writeGraph(std::ostream& os, const Graph &g, 
+                  const CapacityMap& capacity) {
+    GraphWriter<Graph> reader(os, g);
+    IdMap<Graph, typename Graph::Node> nodeIdMap(g);
+    reader.addNodeMap("id", nodeIdMap);
+    IdMap<Graph, typename Graph::Edge> edgeIdMap(g);
+    reader.addEdgeMap("id", edgeIdMap);
+    reader.addEdgeMap("capacity", capacity);
+    reader.run();
+  }
+  /// Ready to use writer function.  
+  template<typename Graph>
+  void writeGraph(std::ostream& os, const Graph &g) {
+    GraphWriter<Graph> reader(os, g);
+    IdMap<Graph, typename Graph::Node> nodeIdMap(g);
+    reader.addNodeMap("id", nodeIdMap);
+    IdMap<Graph, typename Graph::Edge> edgeIdMap(g);
+    reader.addEdgeMap("id", edgeIdMap);
+    reader.run();
+  }
+
 
 }