/* -*- C++ -*-

  * src/lemon/graph_writer.h - Part of LEMON, a generic C++ optimization library

  *

  * Copyright (C) 2005 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

  * (Egervary Research Group on Combinatorial Optimization, EGRES).

  *

  * Permission to use, modify and distribute this software is granted

  * provided that this copyright notice appears in all copies. For

  * precise terms see the accompanying LICENSE file.

  *

  * This software is provided "AS IS" with no warranty of any kind,

  * express or implied, and with no claim as to its suitability for any

  * purpose.

  *

  */

 ///\ingroup io_group

 ///\file

 ///\brief Lemon Graph Format writer.

 #ifndef LEMON_GRAPH_WRITER_H

 #define LEMON_GRAPH_WRITER_H

 #include <iostream>

 #include <lemon/error.h>

 #include <lemon/lemon_writer.h>

 namespace lemon {

   /// \addtogroup io_group

   /// @{

   /// \brief The graph writer class.

   ///

   /// The \c GraphWriter class provides the graph output. To write a graph

   /// you should first give writing commands for the writer. You can declare

   /// write command as \c NodeMap or \c EdgeMap writing and labeled Node and

   /// Edge writing.

   ///

   /// \code

   /// GraphWriter<ListGraph> writer(std::cout, graph);

   /// \endcode

   ///

   /// The \c writeNodeMap() function declares a \c NodeMap writing 

   /// command in the \c GraphWriter. You should give as parameter 

   /// the name of the map and the map object. The NodeMap writing 

   /// command with name "id" should write a unique map because it 

   /// is regarded as ID map.

   ///

   /// \code

   /// IdMap<ListGraph, Node> nodeIdMap;

   /// writer.writeNodeMap("id", nodeIdMap);

   ///

   /// writer.writeNodeMap("x-coord", xCoordMap);

   /// writer.writeNodeMap("y-coord", yCoordMap);

   /// writer.writeNodeMap("color", colorMap);

   /// \endcode

   ///

   /// With the \c writeEdgeMap() member function you can give an edge map

   /// writing command similar to the NodeMaps.

   ///

   /// \code

   /// DescriptorMap<ListGraph, Edge, ListGraph::EdgeMap<int> > 

   ///   edgeDescMap(graph);

   /// writer.writeEdgeMap("descriptor", edgeDescMap);

   ///

   /// writer.writeEdgeMap("weight", weightMap);

   /// writer.writeEdgeMap("label", labelMap);

   /// \endcode

   ///

   /// With \c writeNode() and \c writeEdge() functions you can 

   /// point out Nodes and Edges in the graph. By example, you can 

   /// write out the source and target of the graph.

   ///

   /// \code

   /// writer.writeNode("source", sourceNode);

   /// writer.writeNode("target", targetNode);

   ///

   /// writer.writeEdge("observed", edge);

   /// \endcode

   ///

   /// After you give all write commands you must call the \c run() member

   /// function, which execute all the writer commands.

   ///

   /// \code

   /// writer.run();

   /// \endcode

   ///

   /// \see DefaultWriterTraits

   /// \see QuotedStringWriter

   /// \see IdMap

   /// \see DescriptorMap

   /// \see \ref GraphWriter

   /// \see \ref graph-io-page

   /// \author Balazs Dezso

   template <typename _Graph, typename _WriterTraits = DefaultWriterTraits> 

   class GraphWriter {

   public:

     typedef _Graph Graph;

     typedef typename Graph::Node Node;

     typedef typename Graph::Edge Edge;

     typedef _WriterTraits WriterTraits;

     /// \brief Construct a new GraphWriter.

     ///

     /// Construct a new GraphWriter. It writes the given graph

     /// to the given stream.

     GraphWriter(std::ostream& _os, const Graph& _graph) 

       : writer(new LemonWriter(_os)), own_writer(true), 

 	graph(_graph), 

 	nodeset_writer(*writer, graph, std::string()),

 	edgeset_writer(*writer, graph, nodeset_writer, std::string()),

 	node_writer(*writer, nodeset_writer, std::string()),

 	edge_writer(*writer, edgeset_writer, std::string()),

 	attribute_writer(*writer, std::string()) {}

     /// \brief Construct a new GraphWriter.

     ///

     /// Construct a new GraphWriter. It writes into the given graph

     /// to the given file.

     GraphWriter(const std::string& _filename, const Graph& _graph) 

       : writer(new LemonWriter(_filename)), own_writer(true), 

 	graph(_graph),

 	nodeset_writer(*writer, graph, std::string()),

 	edgeset_writer(*writer, graph, nodeset_writer, std::string()),

 	node_writer(*writer, nodeset_writer, std::string()),

 	edge_writer(*writer, edgeset_writer, std::string()),

 	attribute_writer(*writer, std::string()) {}

     /// \brief Construct a new GraphWriter.

     ///

     /// Construct a new GraphWriter. It writes into the given graph

     /// to given LemonReader.

     GraphWriter(LemonWriter& _writer, const Graph& _graph)

       : writer(_writer), own_writer(false), 

 	graph(_graph),

 	nodeset_writer(*writer, graph, std::string()),

 	edgeset_writer(*writer, graph, nodeset_writer, std::string()),

 	node_writer(*writer, nodeset_writer, std::string()),

 	edge_writer(*writer, edgeset_writer, std::string()),

 	attribute_writer(*writer, std::string()) {}

     /// \brief Destruct the graph writer.

     ///

     /// Destruct the graph writer.

     ~GraphWriter() {

       if (own_writer) 

 	delete writer;

     }

     /// \brief Add a new node map writer command for the writer.

     ///

     /// Add a new node map writer command for the writer.

     template <typename Map>

     GraphWriter& writeNodeMap(std::string name, const Map& map) {

       nodeset_writer.writeMap(name, map);

       return *this;

     }

     /// \brief Add a new node map writer command for the writer.

     ///

     /// Add a new node map writer command for the writer.

     template <typename Writer, typename Map>

     GraphWriter& writeNodeMap(std::string name, const Map& map, 

 			     const Writer& writer = Writer()) {

       nodeset_writer.writeMap(name, map, writer);

       return *this;

     }

     /// \brief Add a new edge map writer command for the writer.

     ///

     /// Add a new edge map writer command for the writer.

     template <typename Map>

     GraphWriter& writeEdgeMap(std::string name, const Map& map) { 

       edgeset_writer.writeMap(name, map);

       return *this;

     }

     /// \brief Add a new edge map writer command for the writer.

     ///

     /// Add a new edge map writer command for the writer.

     template <typename Writer, typename Map>

     GraphWriter& writeEdgeMap(std::string name, const Map& map,

 			     const Writer& writer = Writer()) {

       edgeset_writer.writeMap(name, map, writer);

       return *this;

     }

     /// \brief Add a new labeled node writer for the writer.

     ///

     /// Add a new labeled node writer for the writer.

     GraphWriter& writeNode(std::string name, const Node& node) {

       node_writer.writeNode(name, node);

       return *this;

     }

     /// \brief Add a new labeled edge writer for the writer.

     ///

     /// Add a new labeled edge writer for the writer.

     GraphWriter& writeEdge(std::string name, const Edge& edge) {

       edge_writer.writeEdge(name, edge);

     }

     /// \brief Add a new attribute writer command.

     ///

     ///  Add a new attribute writer command.

     template <typename Value>

     GraphWriter& writeAttribute(std::string name, const Value& value) {

       attribute_writer.writeAttribute(name, value);

       return *this;

     }

     /// \brief Add a new attribute writer command.

     ///

     ///  Add a new attribute writer command.

     template <typename Writer, typename Value>

     GraphWriter& writeAttribute(std::string name, const Value& value, 

 			       const Writer& writer) {

       attribute_writer.writeAttribute<Writer>(name, value, writer);

       return *this;

     }

     /// \brief Conversion operator to LemonWriter.

     ///

     /// Conversion operator to LemonWriter. It make possible

     /// to access the encapsulated \e LemonWriter, this way

     /// you can attach to this writer new instances of 

     /// \e LemonWriter::SectionWriter.

     operator LemonWriter&() {

       return *writer;

     }

     /// \brief Executes the writer commands.

     ///

     /// Executes the writer commands.

     void run() {

       writer->run();

     }

   private:

     LemonWriter* writer;

     bool own_writer;

     const Graph& graph;

     NodeSetWriter<Graph, WriterTraits> nodeset_writer;

     EdgeSetWriter<Graph, WriterTraits> edgeset_writer;

     NodeWriter<Graph> node_writer;

     EdgeWriter<Graph> edge_writer;

     AttributeWriter<WriterTraits> attribute_writer;

   };

   /// \brief Write a graph to the output.

   ///

   /// Write a graph to the output.

   /// \param os The output stream.

   /// \param g The graph.

   /// \param capacity The capacity map.

   /// \param s The source node.

   /// \param t The target node.

   /// \param cost The cost map.

   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> writer(os, g);

     IdMap<Graph, typename Graph::Node> nodeIdMap(g);

     writer.writeNodeMap("id", nodeIdMap);

     IdMap<Graph, typename Graph::Edge> edgeIdMap(g);

     writer.writeEdgeMap("id", edgeIdMap);

     writer.writeEdgeMap("capacity", capacity);

     writer.writeEdgeMap("cost", cost);

     writer.writeNode("source", s);

     writer.writeNode("target", t);

     writer.run();

   }

   /// \brief Write a graph to the output.

   ///

   /// Write a graph to the output.

   /// \param os The output stream.

   /// \param g The graph.

   /// \param capacity The capacity map.

   /// \param s The source node.

   /// \param t The target node.

   template<typename Graph, typename CapacityMap>

   void writeGraph(std::ostream& os, const Graph &g, 

 		  const CapacityMap& capacity, const typename Graph::Node &s,

 		  const typename Graph::Node &t) {

     GraphWriter<Graph> writer(os, g);

     IdMap<Graph, typename Graph::Node> nodeIdMap(g);

     writer.writeNodeMap("id", nodeIdMap);

     IdMap<Graph, typename Graph::Edge> edgeIdMap(g);

     writer.writeEdgeMap("id", edgeIdMap);

     writer.writeEdgeMap("capacity", capacity);

     writer.writeNode("source", s);

     writer.writeNode("target", t);

     writer.run();

   }

   /// \brief Write a graph to the output.

   ///

   /// Write a graph to the output.

   /// \param os The output stream.

   /// \param g The graph.

   /// \param capacity The capacity map.

   /// \param s The source node.

   template<typename Graph, typename CapacityMap>

   void writeGraph(std::ostream& os, const Graph &g, 

 		  const CapacityMap& capacity, const typename Graph::Node &s) {

     GraphWriter<Graph> writer(os, g);

     IdMap<Graph, typename Graph::Node> nodeIdMap(g);

     writer.writeNodeMap("id", nodeIdMap);

     IdMap<Graph, typename Graph::Edge> edgeIdMap(g);

     writer.writeEdgeMap("id", edgeIdMap);

     writer.writeEdgeMap("capacity", capacity);

     writer.writeNode("source", s);

     writer.run();

   }

   /// \brief Write a graph to the output.

   ///

   /// Write a graph to the output.

   /// \param os The output stream.

   /// \param g The graph.

   /// \param capacity The capacity map.

   template<typename Graph, typename CapacityMap>

   void writeGraph(std::ostream& os, const Graph &g, 

 		  const CapacityMap& capacity) {

     GraphWriter<Graph> writer(os, g);

     IdMap<Graph, typename Graph::Node> nodeIdMap(g);

     writer.writeNodeMap("id", nodeIdMap);

     IdMap<Graph, typename Graph::Edge> edgeIdMap(g);

     writer.writeEdgeMap("id", edgeIdMap);

     writer.writeEdgeMap("capacity", capacity);

     writer.run();

   }

   /// \brief Write a graph to the output.

   ///

   /// Write a graph to the output.

   /// \param os The output stream.

   /// \param g The graph.

   template<typename Graph>

   void writeGraph(std::ostream& os, const Graph &g) {

     GraphWriter<Graph> writer(os, g);

     IdMap<Graph, typename Graph::Node> nodeIdMap(g);

     writer.writeNodeMap("id", nodeIdMap);

     IdMap<Graph, typename Graph::Edge> edgeIdMap(g);

     writer.writeEdgeMap("id", edgeIdMap);

     writer.run();

   }

   /// @}

 }

 #endif