deba@1137: /* -*- C++ -*-
deba@1137:  * src/lemon/graph_reader.h - Part of LEMON, a generic C++ optimization library
deba@1137:  *
alpar@1164:  * Copyright (C) 2005 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
deba@1137:  * (Egervary Combinatorial Optimization Research Group, EGRES).
deba@1137:  *
deba@1137:  * Permission to use, modify and distribute this software is granted
deba@1137:  * provided that this copyright notice appears in all copies. For
deba@1137:  * precise terms see the accompanying LICENSE file.
deba@1137:  *
deba@1137:  * This software is provided "AS IS" with no warranty of any kind,
deba@1137:  * express or implied, and with no claim as to its suitability for any
deba@1137:  * purpose.
deba@1137:  *
deba@1137:  */
deba@1137: 
alpar@1287: ///\ingroup io_group
deba@1137: ///\file
alpar@1287: ///\brief Lemon Graph Format reader.
deba@1137: 
deba@1214: #ifndef LEMON_GRAPH_READER_H
deba@1214: #define LEMON_GRAPH_READER_H
deba@1214: 
deba@1137: #include <iostream>
deba@1137: #include <sstream>
deba@1137: 
deba@1137: #include <map>
deba@1137: #include <vector>
deba@1137: 
deba@1137: #include <memory>
deba@1137: 
deba@1137: #include <lemon/error.h>
deba@1137: 
deba@1137: 
deba@1137: namespace lemon {
deba@1137: 
deba@1333:   /// \addtogroup io_group
deba@1333:   /// @{
deba@1137: 
deba@1137:   /// \brief Standard ReaderTraits for the GraphReader class.
deba@1137:   ///
deba@1137:   /// Standard ReaderTraits for the GraphReader class.
deba@1137:   /// It defines standard reading method for all type of value. 
deba@1333:   /// \author Balazs Dezso
deba@1137:   struct DefaultReaderTraits {
deba@1137: 
deba@1333:     /// \brief Template class for reading an value.
deba@1137:     ///
deba@1137:     /// Template class for reading an value.
deba@1333:     /// \author Balazs Dezso
deba@1137:     template <typename _Value>
deba@1137:     struct Reader {
deba@1137:       /// The value type.
deba@1137:       typedef _Value Value;
deba@1137:       /// \brief Reads a value from the given stream.
deba@1137:       ///
deba@1137:       /// Reads a value from the given stream.
deba@1137:       void read(std::istream& is, Value& value) {
deba@1137: 	if (!(is >> value)) 
deba@1208: 	  throw DataFormatError("Default reader format exception");
deba@1137:       }
deba@1137:     };
deba@1137: 
deba@1333:     /// \brief Returns wheter this name is an ID map name.
deba@1333:     ///
deba@1333:     /// Returns wheter this name is an ID map name.
deba@1333:     static bool idMapName(const std::string& name) {
deba@1333:       return name == "id";
deba@1333:     }
deba@1333: 
deba@1137:     /// The reader class for the not needed maps.
deba@1137:     typedef Reader<std::string> DefaultReader;
deba@1137: 
deba@1137:   };
deba@1137: 
deba@1137:   /// \brief Reader class for quoted strings.
deba@1137:   ///
deba@1137:   /// Reader class for quoted strings. It can process the escape
deba@1137:   /// sequences in the string.
deba@1333:   /// \author Balazs Dezso
deba@1137:   class QuotedStringReader {
deba@1137:   public:
deba@1137:     typedef std::string Value;
deba@1137:     
deba@1137:     /// \brief Constructor for the reader.
deba@1137:     ///
deba@1137:     /// Constructor for the reader. If the given parameter is true
deba@1137:     /// the reader processes the escape sequences.
deba@1137:     QuotedStringReader(bool _escaped = true) : escaped(_escaped) {}
deba@1137:     
deba@1137:     /// \brief Reads a quoted string from the given stream.
deba@1137:     ///
deba@1137:     /// Reads a quoted string from the given stream.
deba@1137:     void read(std::istream& is, std::string& value) {
deba@1137:       char c;
deba@1137:       value.clear();
deba@1311:       is >> std::ws;
deba@1137:       if (!is.get(c) || c != '\"') 
deba@1208: 	throw DataFormatError("Quoted string format error");
deba@1137:       while (is.get(c) && c != '\"') {
deba@1137: 	if (escaped && c == '\\') {
deba@1137: 	  value += readEscape(is);
deba@1137: 	} else {
deba@1137: 	  value += c;
deba@1137: 	}
deba@1137:       }
deba@1208:       if (!is) throw DataFormatError("Quoted string format error");
deba@1137:     }
deba@1137: 
deba@1137:   private:
deba@1137:     
deba@1137:     static char readEscape(std::istream& is) {
deba@1137:       char c;
deba@1137:       switch (is.get(c), c) {
deba@1137:       case '\\':
deba@1137: 	return '\\';
deba@1137:       case '\"':
deba@1137: 	return '\"';
deba@1137:       case '\'':
deba@1137: 	return '\'';
deba@1137:       case '\?':
deba@1137: 	return '\?';
deba@1137:       case 'a':
deba@1137: 	return '\a';
deba@1137:       case 'b':
deba@1137: 	return '\b';
deba@1137:       case 'f':
deba@1137: 	return '\f';
deba@1137:       case 'n':
deba@1137: 	return '\n';
deba@1137:       case 'r':
deba@1137: 	return '\r';
deba@1137:       case 't':
deba@1137: 	return '\t';
deba@1137:       case 'v':
deba@1137: 	return '\v';
deba@1137:       case 'x':
deba@1137: 	{
deba@1137: 	  int code;
deba@1137: 	  if (!is.get(c) || !isHex(c)) 
deba@1208: 	    throw DataFormatError("Escape format error");
deba@1137: 	  else if (code = valueHex(c), !is.get(c) || !isHex(c)) is.putback(c);
deba@1137: 	  else code = code * 16 + valueHex(c);
deba@1137: 	  return code;
deba@1137: 	}
deba@1137:       default:
deba@1137: 	{
deba@1137: 	  int code;
deba@1137: 	  if (!isOct(c)) 
deba@1208: 	    throw DataFormatError("Escape format error");
deba@1137: 	  else if (code = valueOct(c), !is.get(c) || !isOct(c)) 
deba@1137: 	    is.putback(c);
deba@1137: 	  else if (code = code * 8 + valueOct(c), !is.get(c) || !isOct(c)) 
deba@1137: 	    is.putback(c);
deba@1137: 	  else code = code * 8 + valueOct(c);
deba@1137: 	  return code;
deba@1137: 	}	      
deba@1137:       } 
deba@1137:     }
deba@1137: 
deba@1137:     static bool isOct(char c) {
deba@1137:       return '0' <= c && c <='7'; 
deba@1137:     }
deba@1137:     
deba@1137:     static int valueOct(char c) {
deba@1137:       return c - '0';
deba@1137:     }
deba@1137: 
deba@1137:    static bool isHex(char c) {
deba@1137:       return ('0' <= c && c <= '9') || 
deba@1137: 	('a' <= c && c <= 'z') || 
deba@1137: 	('A' <= c && c <= 'Z'); 
deba@1137:     }
deba@1137:     
deba@1137:     static int valueHex(char c) {
deba@1137:       if ('0' <= c && c <= '9') return c - '0';
deba@1137:       if ('a' <= c && c <= 'z') return c - 'a' + 10;
deba@1137:       return c - 'A' + 10;
deba@1137:     }
deba@1137: 
deba@1137:     bool escaped;
deba@1137:   };
deba@1137: 
deba@1137:   /// \brief The graph reader class.
deba@1137:   ///
deba@1333:   ///
deba@1333:   /// The given file format may contain several maps and labeled nodes or 
deba@1333:   /// edges.
deba@1333:   ///
deba@1333:   /// If you read a graph you need not read all the maps and items just those
deba@1333:   /// that you need. The interface of the \c GraphReader is very similar to
deba@1333:   /// the GraphWriter but the reading method does not depend on the order the
deba@1333:   /// given commands.
deba@1333:   ///
deba@1333:   /// The reader object suppose that each not readed value does not contain 
deba@1333:   /// whitespaces, therefore it has some extra possibilities to control how
deba@1333:   /// it should skip the values when the string representation contains spaces.
deba@1333:   ///
deba@1333:   /// \code
deba@1333:   /// GraphReader<ListGraph> reader(std::cin, graph);
deba@1333:   /// \endcode
deba@1333:   ///
deba@1333:   /// The \c addNodeMap() function reads a map from the \c \@nodeset section.
deba@1333:   /// If there is a map that you do not want to read from the file and there is
deba@1333:   /// whitespace in the string represenation of the values then you should
deba@1333:   /// call the \c skipNodeMap() template member function with proper 
deba@1333:   /// parameters.
deba@1333:   ///
deba@1333:   /// \code
deba@1333:   /// reader.addNodeMap("x-coord", xCoordMap);
deba@1333:   /// reader.addNodeMap("y-coord", yCoordMap);
deba@1333:   ///
deba@1333:   /// reader.addNodeMap<QuotedStringReader>("label", labelMap);
deba@1333:   /// reader.skipNodeMap<QuotedStringReader>("description");
deba@1333:   ///
deba@1333:   /// reader.addNodeMap("color", colorMap);
deba@1333:   /// \endcode
deba@1333:   ///
deba@1333:   /// With the \c addEdgeMap() member function you can give an edge map
deba@1333:   /// reading command similar to the NodeMaps. 
deba@1333:   ///
deba@1333:   /// \code
deba@1333:   /// reader.addEdgeMap("weight", weightMap);
deba@1333:   /// reader.addEdgeMap("label", labelMap);
deba@1333:   /// \endcode
deba@1333:   ///
deba@1333:   /// With \c addNode() and \c addEdge() functions you can read labeled Nodes 
deba@1333:   /// and Edges.
deba@1333:   ///
deba@1333:   /// \code
deba@1333:   /// reader.addNode("source", sourceNode);
deba@1333:   /// reader.addNode("target", targetNode);
deba@1333:   ///
deba@1333:   /// reader.addEdge("observed", edge);
deba@1333:   /// \endcode
deba@1333:   ///
deba@1333:   /// After you give all read commands you must call the \c run() member
deba@1333:   /// function, which execute all the commands.
deba@1333:   ///
deba@1333:   /// \code
deba@1333:   /// reader.run();
deba@1333:   /// \endcode
deba@1333:   ///
alpar@1287:   /// \see DefaultReaderTraits
alpar@1287:   /// \see QuotedStringReader
alpar@1138:   /// \see \ref GraphWriter
alpar@1138:   /// \see \ref graph-io-page
deba@1333:   /// \author Balazs Dezso
deba@1137:   template <typename _Graph, typename _ReaderTraits = DefaultReaderTraits> 
deba@1137:   class GraphReader {
deba@1137:   public:
deba@1137:     
deba@1137:     typedef _Graph Graph;
deba@1137:     typedef typename Graph::Node Node;
deba@1137:     typedef typename Graph::Edge Edge;
deba@1137: 
deba@1137:     typedef _ReaderTraits ReaderTraits;
deba@1137:     typedef typename ReaderTraits::DefaultReader DefaultReader;
deba@1137: 
deba@1137:     /// \brief Construct a new GraphReader.
deba@1137:     ///
deba@1208:     /// Construct a new GraphReader. It reads into the given graph
deba@1208:     /// and it use the given reader as the default skipper.
deba@1137:     GraphReader(std::istream& _is, Graph& _graph, 
deba@1137: 		const DefaultReader& _reader = DefaultReader()) 
deba@1137:       : is(_is), graph(_graph), nodeSkipper(_reader), edgeSkipper(_reader) {}
deba@1137: 
deba@1137:     /// \brief Destruct the graph reader.
deba@1137:     ///
deba@1137:     /// Destruct the graph reader.
deba@1137:     ~GraphReader() {
deba@1137:       for (typename NodeMapReaders::iterator it = node_map_readers.begin(); 
deba@1137: 	   it != node_map_readers.end(); ++it) {
deba@1137: 	delete it->second;
deba@1137:       }
deba@1137: 
deba@1137:       for (typename EdgeMapReaders::iterator it = edge_map_readers.begin(); 
deba@1137: 	   it != edge_map_readers.end(); ++it) {
deba@1137: 	delete it->second;
deba@1137:       }
deba@1137: 
deba@1137:     }
deba@1137: 
deba@1137:     /// \brief Add a new node map reader command for the reader.
deba@1137:     ///
deba@1137:     /// Add a new node map reader command for the reader.
deba@1137:     template <typename Map>
deba@1137:     GraphReader& addNodeMap(std::string name, Map& map) {
deba@1137:       return addNodeMap<typename ReaderTraits::template 
deba@1137: 	Reader<typename Map::Value>, Map>(name, map);
deba@1137:     }
deba@1137: 
deba@1137:     /// \brief Add a new node map reader command for the reader.
deba@1137:     ///
deba@1137:     /// Add a new node map reader command for the reader.
deba@1137:     template <typename Reader, typename Map>
deba@1137:     GraphReader& addNodeMap(std::string name, Map& map, 
deba@1137: 			     const Reader& reader = Reader()) {
deba@1137:       if (node_map_readers.find(name) != node_map_readers.end()) {
deba@1208: 	ErrorMessage msg;
deba@1208: 	msg << "Multiple read rule for node map: " << name;
deba@1214: 	throw IOParameterError(msg.message());
deba@1137:       }
deba@1137:       node_map_readers.insert(
deba@1137:         make_pair(name, new MapReader<Node, Map, Reader>(map, reader)));
deba@1137:       return *this;
deba@1137:     }
deba@1137: 
deba@1137:     /// \brief Add a new node map skipper command for the reader.
deba@1137:     ///
deba@1137:     /// Add a new node map skipper command for the reader.
deba@1137:     template <typename Reader>
deba@1137:     GraphReader& skipNodeMap(std::string name, 
deba@1137: 			     const Reader& reader = Reader()) {
deba@1137:       if (node_map_readers.find(name) != node_map_readers.end()) {
deba@1208: 	ErrorMessage msg;
deba@1208: 	msg << "Multiple read rule for node map: " << name;
deba@1214: 	throw IOParameterError(msg.message());
deba@1137:       }
deba@1137:       node_map_readers.insert(
deba@1137:         make_pair(name, new SkipReader<Node, Reader>(reader)));
deba@1137:       return *this;
deba@1137:     }
deba@1137: 
deba@1137:     /// \brief Add a new edge map reader command for the reader.
deba@1137:     ///
deba@1137:     /// Add a new edge map reader command for the reader.
deba@1137:     template <typename Map>
deba@1137:     GraphReader& addEdgeMap(std::string name, Map& map) { 
deba@1137:       return addEdgeMap<typename ReaderTraits::template
deba@1137: 	Reader<typename Map::Value>, Map>(name, map);
deba@1137:     }
deba@1137: 
deba@1137: 
deba@1137:     /// \brief Add a new edge map reader command for the reader.
deba@1137:     ///
deba@1137:     /// Add a new edge map reader command for the reader.
deba@1137:     template <typename Reader, typename Map>
deba@1137:     GraphReader& addEdgeMap(std::string name, Map& map,
deba@1137: 			     const Reader& reader = Reader()) {
deba@1137:       if (edge_map_readers.find(name) != edge_map_readers.end()) {
deba@1208: 	ErrorMessage msg;
deba@1208: 	msg << "Multiple read rule for edge map: " << name;
deba@1214: 	throw IOParameterError(msg.message());
deba@1137:       }
deba@1137:       edge_map_readers.insert(
deba@1137:         make_pair(name, new MapReader<Edge, Map, Reader>(map, reader)));
deba@1137:       return *this;
deba@1137:     }
deba@1137: 
deba@1137:     /// \brief Add a new edge map skipper command for the reader.
deba@1137:     ///
deba@1137:     /// Add a new edge map skipper command for the reader.
deba@1137:     template <typename Reader>
deba@1137:     GraphReader& skipEdgeMap(std::string name,
deba@1137: 			     const Reader& reader = Reader()) {
deba@1137:       if (edge_map_readers.find(name) != edge_map_readers.end()) {
deba@1208: 	ErrorMessage msg;
deba@1208: 	msg << "Multiple read rule for edge map: " << name;
deba@1214: 	throw IOParameterError(msg.message());
deba@1137:       }
deba@1137:       edge_map_readers.insert(
deba@1137:         make_pair(name, new SkipReader<Edge, Reader>(reader)));
deba@1137:       return *this;
deba@1137:     }
deba@1137: 
deba@1137:     /// \brief Add a new labeled node reader for the reader.
deba@1137:     ///
deba@1137:     /// Add a new labeled node reader for the reader.
deba@1137:     GraphReader& addNode(std::string name, Node& node) {
deba@1137:       if (node_readers.find(name) != node_readers.end()) {
deba@1208: 	ErrorMessage msg;
deba@1208: 	msg << "Multiple read rule for node: " << name;
deba@1214: 	throw IOParameterError(msg.message());
deba@1137:       }
deba@1137:       node_readers.insert(make_pair(name, &node));
deba@1137:       return *this;
deba@1137:     }
deba@1137: 
deba@1137:     /// \brief Add a new labeled edge reader for the reader.
deba@1137:     ///
deba@1137:     /// Add a new labeled edge reader for the reader.
deba@1137:     GraphReader& addEdge(std::string name, Edge& edge) {
deba@1137:       if (edge_readers.find(name) != edge_readers.end()) {
deba@1208: 	ErrorMessage msg;
deba@1208: 	msg << "Multiple read rule for edge: " << name;
deba@1214: 	throw IOParameterError(msg.message());
deba@1137:       }
deba@1137:       edge_readers.insert(make_pair(name, &edge));
deba@1137:       return *this;
deba@1137:     }
deba@1137: 
deba@1137:     /// \brief Executes the reader commands.
deba@1137:     ///
deba@1137:     /// Executes the reader commands.
deba@1137:     void run() {
deba@1137:       int line_num = 0;
deba@1137:       std::auto_ptr<InverterBase<Node> > nodeInverter;
deba@1137:       std::auto_ptr<InverterBase<Edge> > edgeInverter;
deba@1137:       try {
deba@1137: 	std::string line = readNotEmptyLine(is, line_num);
deba@1137: 	if (line.find("@nodeset") == 0) {
deba@1137: 	  line = readNodeSet(line_num, nodeInverter);
deba@1137: 	} 
deba@1137: 	if (line.find("@edgeset") == 0) {
deba@1137: 	  line = readEdgeSet(line_num, edgeInverter, nodeInverter);
deba@1137: 	}
deba@1137: 	if (line.find("@nodes") == 0) {
deba@1137: 	  line = readNodes(line_num, nodeInverter);
deba@1137: 	}
deba@1137: 	if (line.find("@edges") == 0) {
deba@1137: 	  line = readEdges(line_num, edgeInverter);
deba@1137: 	}
deba@1137: 	if (line.find("@end") != 0) {
deba@1208: 	  throw DataFormatError("Invalid control sequence error");
deba@1137: 	}
deba@1208:       } catch (DataFormatError e) {
deba@1208: 	e.line(line_num);
deba@1208: 	throw e;
deba@1137:       }
deba@1137:     }
deba@1137: 
deba@1137:   private:
deba@1137: 
deba@1137:     template <typename Item> class InverterBase;
deba@1137: 
deba@1137:     std::string readNodeSet(int& line_num, 
deba@1311: 			    std::auto_ptr<InverterBase<Node> >& nodeInverter) {
deba@1137:       std::vector<ReaderBase<Node>* > index;
deba@1137:       {
deba@1137: 	std::string line = readNotEmptyLine(is, line_num);    
deba@1137: 	std::string id;
deba@1137: 	std::istringstream ls(line);	
deba@1137: 	while (ls >> id) {
deba@1137: 	  typename NodeMapReaders::iterator it = node_map_readers.find(id);
deba@1137: 	  if (it != node_map_readers.end()) {
deba@1137: 	    index.push_back(it->second);
deba@1137: 	    node_map_readers.erase(it);
deba@1137: 	  } else {
deba@1137: 	    index.push_back(&nodeSkipper);
deba@1137: 	  }
deba@1333: 	  if (ReaderTraits::idMapName(id) && nodeInverter.get() == 0) {
deba@1333: 	    nodeInverter.reset(index.back()->getInverter());
deba@1333: 	    index.back() = nodeInverter.get();
deba@1333: 	  }
deba@1137: 	}
deba@1137:       }
deba@1137: 
deba@1333: //       if (index.size() == 0) {
deba@1333: // 	throw DataFormatError("Cannot find node id map");
deba@1333: //       }
deba@1137: 
deba@1333: //       nodeInverter = 
deba@1333: // 	std::auto_ptr<InverterBase<Node> >(index[0]->getInverter());
deba@1137:       std::string line;
deba@1137:       while (line = readNotEmptyLine(is, line_num), line[0] != '@') {
deba@1137: 	Node node = graph.addNode();
deba@1137: 	std::istringstream ls(line);
deba@1333: 	for (int i = 0; i < (int)index.size(); ++i) {
deba@1137: 	  index[i]->read(ls, node);
deba@1137: 	}
deba@1137:       }
deba@1137:       return line;
deba@1137:     }
deba@1137: 
deba@1137:     std::string readEdgeSet(int& line_num, 
deba@1311: 			    std::auto_ptr<InverterBase<Edge> >& edgeInverter, 
deba@1311: 			    std::auto_ptr<InverterBase<Node> >& nodeInverter) {
deba@1137:       std::vector<ReaderBase<Edge>*> index;
deba@1137:       {
deba@1137: 	std::string line = readNotEmptyLine(is, line_num);    
deba@1137: 	std::string id;
deba@1137: 	std::istringstream ls(line);	
deba@1137: 	while (ls >> id) {
deba@1137: 	  typename EdgeMapReaders::iterator it = edge_map_readers.find(id);
deba@1137: 	  if (it != edge_map_readers.end()) {
deba@1137: 	    index.push_back(it->second);
deba@1137: 	    edge_map_readers.erase(it);
deba@1137: 	  } else {
deba@1137: 	    index.push_back(&edgeSkipper);
deba@1137: 	  }
deba@1333: 	  if (ReaderTraits::idMapName(id) && edgeInverter.get() == 0) {
deba@1333: 	    edgeInverter.reset(index.back()->getInverter());
deba@1333: 	    index.back() = edgeInverter.get();
deba@1333: 	  }
deba@1137: 	}
deba@1137:       }
deba@1333:       
deba@1333:       if (nodeInverter.get() == 0) {
deba@1333:  	throw DataFormatError("Cannot find node id map");
deba@1333:       }
deba@1333: //       if (index.size() == 0) {
deba@1333: // 	throw DataFormatError("Cannot find edge id map");
deba@1333: //       }
deba@1137: 
deba@1333: //       edgeInverter = 
deba@1333: // 	std::auto_ptr<InverterBase<Edge> >(index[0]->getInverter());
deba@1137:       std::string line;
deba@1137:       while (line = readNotEmptyLine(is, line_num), line[0] != '@') {	
deba@1137: 	std::istringstream ls(line);
deba@1137: 	Node source = nodeInverter->read(ls);
deba@1137: 	Node target = nodeInverter->read(ls);
deba@1137: 	Edge edge = graph.addEdge(source, target);
deba@1333: 	for (int i = 0; i < (int)index.size(); ++i) {
deba@1137: 	  index[i]->read(ls, edge);
deba@1137: 	}
deba@1137:       }      
deba@1137:       return line;
deba@1137:     }
deba@1137: 
deba@1137:     std::string readNodes(int& line_num, 
deba@1311: 			  std::auto_ptr<InverterBase<Node> >& nodeInverter) {
deba@1137:       std::string line;
deba@1333:       if (nodeInverter.get() == 0) {
deba@1333:  	throw DataFormatError("Cannot find node id map");
deba@1333:       }
deba@1137:       while (line = readNotEmptyLine(is, line_num), line[0] != '@') {
deba@1137: 	std::istringstream ls(line);
deba@1137: 	std::string name;
deba@1137: 	ls >> name;
deba@1137: 	typename NodeReaders::iterator it = node_readers.find(name);
deba@1137: 	if (it != node_readers.end()) {
deba@1137: 	  *(it -> second) = nodeInverter->read(ls);
deba@1137: 	} 
deba@1137:       }        
deba@1137:       return line;
deba@1137:     }
deba@1137: 
deba@1137:     std::string readEdges(int& line_num, 
deba@1311: 			  std::auto_ptr<InverterBase<Edge> >& edgeInverter) {
deba@1137:       std::string line;
deba@1333:       if (edgeInverter.get() == 0) {
deba@1333:  	throw DataFormatError("Cannot find edge id map");
deba@1333:       }
deba@1137:       while (line = readNotEmptyLine(is, line_num), line[0] != '@') {
deba@1137: 	std::istringstream ls(line);
deba@1137: 	std::string name;
deba@1137: 	ls >> name;
deba@1137: 	typename EdgeReaders::iterator it = edge_readers.find(name);
deba@1137: 	if (it != edge_readers.end()) {
deba@1137: 	  *(it -> second) = edgeInverter->read(ls);
deba@1137: 	} 
deba@1137:       }        
deba@1137:       return line;    
deba@1137:     }
deba@1137: 
deba@1137:     std::string readNotEmptyLine(std::istream& is, int& line_num) {
deba@1137:       std::string line;
deba@1137:       while (++line_num, getline(is, line)) {	
deba@1333: 	int vi = line.find('#');
deba@1333: 	if (vi != (int)::std::string::npos) {
deba@1333: 	  line = line.substr(0, vi);
deba@1333: 	}
deba@1333: 	vi = line.find_first_not_of(" \t");
deba@1333: 	if (vi != (int)std::string::npos) { 
deba@1137: 	  return line.substr(vi);
deba@1137: 	}
deba@1137:       }
deba@1208:       throw DataFormatError("End of stream error");
deba@1137:     }
deba@1137:     
deba@1333:     template <typename _Item>
deba@1333:     class ReaderBase;
deba@1137:     
deba@1137:     template <typename _Item>
deba@1333:     class InverterBase : public ReaderBase<_Item> {
deba@1137:     public:
deba@1137:       typedef _Item Item;
deba@1137:       virtual void read(std::istream&, const Item&) = 0;
deba@1137:       virtual Item read(std::istream&) = 0;
deba@1333: 
deba@1333:       virtual InverterBase<_Item>* getInverter() {
deba@1333: 	return this;
deba@1333:       }
deba@1137:     };
deba@1137: 
deba@1137:     template <typename _Item, typename _Map, typename _Reader>
deba@1137:     class MapReaderInverter : public InverterBase<_Item> {
deba@1137:     public:
deba@1137:       typedef _Item Item;
deba@1137:       typedef _Reader Reader;
deba@1137:       typedef typename Reader::Value Value;
deba@1137:       typedef _Map Map;
deba@1137:       typedef std::map<Value, Item> Inverse;
deba@1137: 
deba@1137:       Map& map;
deba@1137:       Reader reader;
deba@1137:       Inverse inverse;
deba@1137: 
deba@1137:       MapReaderInverter(Map& _map, const Reader& _reader) 
deba@1137: 	: map(_map), reader(_reader) {}
deba@1137: 
deba@1137:       virtual ~MapReaderInverter() {}
deba@1137: 
deba@1137:       virtual void read(std::istream& is, const Item& item) {
deba@1137: 	Value value;
deba@1137: 	reader.read(is, value);
deba@1137: 	map.set(item, value);
deba@1137: 	typename Inverse::iterator it = inverse.find(value);
deba@1137: 	if (it == inverse.end()) {
deba@1311: 	  inverse.insert(std::make_pair(value, item));
deba@1137: 	} else {
deba@1208: 	  throw DataFormatError("Multiple ID occurence");
deba@1137: 	}
deba@1137:       }
deba@1137: 
deba@1137:       virtual Item read(std::istream& is) {
deba@1137: 	Value value;
deba@1137: 	reader.read(is, value);	
deba@1137: 	typename Inverse::const_iterator it = inverse.find(value);
deba@1137: 	if (it != inverse.end()) {
deba@1137: 	  return it->second;
deba@1137: 	} else {
deba@1208: 	  throw DataFormatError("Invalid ID error");
deba@1137: 	}
deba@1137:       }      
deba@1137:     };
deba@1137: 
deba@1137:     template <typename _Item, typename _Reader>
deba@1137:     class SkipReaderInverter : public InverterBase<_Item> {
deba@1137:     public:
deba@1137:       typedef _Item Item;
deba@1137:       typedef _Reader Reader;
deba@1137:       typedef typename Reader::Value Value;
deba@1137:       typedef std::map<Value, Item> Inverse;
deba@1137: 
deba@1137:       Reader reader;
deba@1137: 
deba@1137:       SkipReaderInverter(const Reader& _reader) 
deba@1137: 	: reader(_reader) {}
deba@1137: 
deba@1137:       virtual ~SkipReaderInverter() {}
deba@1137: 
deba@1137:       virtual void read(std::istream& is, const Item& item) {
deba@1137: 	Value value;
deba@1137: 	reader.read(is, value);
deba@1137: 	typename Inverse::iterator it = inverse.find(value);
deba@1137: 	if (it == inverse.end()) {
deba@1311: 	  inverse.insert(std::make_pair(value, item));
deba@1137: 	} else {
deba@1208: 	  throw DataFormatError("Multiple ID occurence error");
deba@1137: 	}
deba@1137:       }
deba@1137: 
deba@1137:       virtual Item read(std::istream& is) {
deba@1137: 	Value value;
deba@1137: 	reader.read(is, value);	
deba@1137: 	typename Inverse::const_iterator it = inverse.find(value);
deba@1137: 	if (it != inverse.end()) {
deba@1137: 	  return it->second;
deba@1137: 	} else {
deba@1208: 	  throw DataFormatError("Invalid ID error");
deba@1137: 	}
deba@1137:       }      
deba@1137:     private:
deba@1137:       Inverse inverse;
deba@1137:     };
deba@1137: 
deba@1137:     // Readers
deba@1137: 
deba@1137:     template <typename _Item>    
deba@1137:     class ReaderBase {
deba@1137:     public:
deba@1137:       typedef _Item Item;
deba@1137: 
deba@1137:       //      virtual ~ReaderBase() {}
deba@1137: 
deba@1137:       virtual void read(std::istream& is, const Item& item) = 0;
deba@1137:       virtual InverterBase<_Item>* getInverter() = 0;
deba@1137:     };
deba@1137: 
deba@1137:     template <typename _Item, typename _Map, typename _Reader>
deba@1137:     class MapReader : public ReaderBase<_Item> {
deba@1137:     public:
deba@1137:       typedef _Map Map;
deba@1137:       typedef _Reader Reader;
deba@1137:       typedef typename Reader::Value Value;
deba@1137:       typedef _Item Item;
deba@1137:       
deba@1137:       Map& map;
deba@1137:       Reader reader;
deba@1137: 
deba@1137:       MapReader(Map& _map, const Reader& _reader) 
deba@1137: 	: map(_map), reader(_reader) {}
deba@1137: 
deba@1137:       virtual ~MapReader() {}
deba@1137: 
deba@1137:       virtual void read(std::istream& is, const Item& item) {
deba@1137: 	Value value;
deba@1137: 	reader.read(is, value);
deba@1137: 	map.set(item, value);
deba@1137:       }
deba@1137: 
deba@1137:       virtual InverterBase<_Item>* getInverter() {
deba@1137: 	return new MapReaderInverter<Item, Map, Reader>(map, reader);
deba@1137:       }
deba@1137:     };
deba@1137: 
deba@1137: 
deba@1137:     template <typename _Item, typename _Reader>
deba@1137:     class SkipReader : public ReaderBase<_Item> {
deba@1137:     public:
deba@1137:       typedef _Reader Reader;
deba@1137:       typedef typename Reader::Value Value;
deba@1137:       typedef _Item Item;
deba@1137: 
deba@1137:       Reader reader;
deba@1137:       SkipReader(const Reader& _reader) : reader(_reader) {}
deba@1137: 
deba@1137:       virtual ~SkipReader() {}
deba@1137: 
alpar@1250:       virtual void read(std::istream& is, const Item&) {
deba@1137: 	Value value;
deba@1137: 	reader.read(is, value);
deba@1137:       }      
deba@1137: 
deba@1137:       virtual InverterBase<Item>* getInverter() {
deba@1137: 	return new SkipReaderInverter<Item, Reader>(reader);
deba@1137:       }
deba@1137:     };
deba@1137: 
deba@1137: 
deba@1137:     typedef std::map<std::string, ReaderBase<Node>*> NodeMapReaders;
deba@1137:     NodeMapReaders node_map_readers;
deba@1137: 
deba@1137:     typedef std::map<std::string, ReaderBase<Edge>*> EdgeMapReaders;
deba@1137:     EdgeMapReaders edge_map_readers;
deba@1137: 
deba@1137:     typedef std::map<std::string, Node*> NodeReaders;
deba@1137:     NodeReaders node_readers;
deba@1137: 
deba@1137:     typedef std::map<std::string, Edge*> EdgeReaders;
deba@1137:     EdgeReaders edge_readers;
deba@1137: 
deba@1137:     std::istream& is;
deba@1137:     Graph& graph;
deba@1137: 
deba@1137:     SkipReader<Node, DefaultReader> nodeSkipper;
deba@1137:     SkipReader<Edge, DefaultReader> edgeSkipper;
deba@1137: 
deba@1137:   };
deba@1137: 
deba@1333:   /// \brief Read a graph from the input.
deba@1333:   ///
deba@1333:   /// Read a graph from the input.
deba@1333:   /// \param is The input stream.
deba@1333:   /// \param g The graph.
deba@1333:   /// \param capacity The capacity map.
deba@1333:   /// \param s The source node.
deba@1333:   /// \param t The target node.
deba@1333:   /// \param cost The cost map.
deba@1208:   template<typename Graph, typename CapacityMap, typename CostMap>
deba@1208:   void readGraph(std::istream& is, Graph &g, CapacityMap& capacity, 
deba@1208: 		  typename Graph::Node &s, typename Graph::Node &t, 
deba@1208: 		  CostMap& cost) {
deba@1208:     GraphReader<Graph> reader(is, g);
deba@1208:     reader.addEdgeMap("capacity", capacity);
deba@1208:     reader.addEdgeMap("cost", cost);
deba@1208:     reader.addNode("source", s);
deba@1208:     reader.addNode("target", t);
deba@1208:     reader.run();
deba@1208:   }
deba@1208: 
deba@1333:   /// \brief Read a graph from the input.
deba@1333:   ///
deba@1333:   /// Read a graph from the input.
deba@1333:   /// \param is The input stream.
deba@1333:   /// \param g The graph.
deba@1333:   /// \param capacity The capacity map.
deba@1333:   /// \param s The source node.
deba@1333:   /// \param t The target node.
deba@1208:   template<typename Graph, typename CapacityMap>
deba@1208:   void readGraph(std::istream& is, Graph &g, CapacityMap& capacity, 
deba@1208: 		  typename Graph::Node &s, typename Graph::Node &t) {
deba@1208:     GraphReader<Graph> reader(is, g);
deba@1208:     reader.addEdgeMap("capacity", capacity);
deba@1208:     reader.addNode("source", s);
deba@1208:     reader.addNode("target", t);
deba@1208:     reader.run();
deba@1208:   }
deba@1208: 
deba@1333:   /// \brief Read a graph from the input.
deba@1333:   ///
deba@1333:   /// Read a graph from the input.
deba@1333:   /// \param is The input stream.
deba@1333:   /// \param g The graph.
deba@1333:   /// \param capacity The capacity map.
deba@1333:   /// \param s The source node.
deba@1208:   template<typename Graph, typename CapacityMap>
deba@1208:   void readGraph(std::istream& is, Graph &g, CapacityMap& capacity, 
deba@1208: 		  typename Graph::Node &s) {
deba@1208:     GraphReader<Graph> reader(is, g);
deba@1208:     reader.addEdgeMap("capacity", capacity);
deba@1208:     reader.addNode("source", s);
deba@1208:     reader.run();
deba@1208:   }
deba@1208: 
deba@1333:   /// \brief Read a graph from the input.
deba@1333:   ///
deba@1333:   /// Read a graph from the input.
deba@1333:   /// \param is The input stream.
deba@1333:   /// \param g The graph.
deba@1333:   /// \param capacity The capacity map.
deba@1208:   template<typename Graph, typename CapacityMap>
deba@1208:   void readGraph(std::istream& is, Graph &g, CapacityMap& capacity) {
deba@1208:     GraphReader<Graph> reader(is, g);
deba@1208:     reader.addEdgeMap("capacity", capacity);
deba@1208:     reader.run();
deba@1208:   }
deba@1208: 
deba@1333:   /// \brief Read a graph from the input.
deba@1333:   ///
deba@1333:   /// Read a graph from the input.
deba@1333:   /// \param is The input stream.
deba@1333:   /// \param g The graph.
deba@1208:   template<typename Graph>
deba@1208:   void readGraph(std::istream& is, Graph &g) {
deba@1208:     GraphReader<Graph> reader(is, g);
deba@1208:     reader.run();
deba@1208:   }
deba@1208: 
deba@1333:   /// @}
deba@1137: }
deba@1214: 
deba@1214: #endif