deba@127: /* -*- C++ -*- deba@127: * deba@127: * This file is a part of LEMON, a generic C++ optimization library deba@127: * deba@127: * Copyright (C) 2003-2008 deba@127: * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport deba@127: * (Egervary Research Group on Combinatorial Optimization, EGRES). deba@127: * deba@127: * Permission to use, modify and distribute this software is granted deba@127: * provided that this copyright notice appears in all copies. For deba@127: * precise terms see the accompanying LICENSE file. deba@127: * deba@127: * This software is provided "AS IS" with no warranty of any kind, deba@127: * express or implied, and with no claim as to its suitability for any deba@127: * purpose. deba@127: * deba@127: */ deba@127: deba@127: ///\ingroup lemon_io deba@127: ///\file kpeter@192: ///\brief \ref lgf-format "Lemon Graph Format" writer. deba@127: deba@127: deba@127: #ifndef LEMON_LGF_WRITER_H deba@127: #define LEMON_LGF_WRITER_H deba@127: deba@127: #include deba@127: #include deba@127: #include deba@127: deba@127: #include deba@127: deba@127: #include deba@127: #include deba@127: deba@127: #include deba@127: #include deba@127: deba@127: namespace lemon { deba@127: deba@127: namespace _writer_bits { deba@127: deba@127: template deba@127: struct DefaultConverter { deba@127: std::string operator()(const Value& value) { deba@127: std::ostringstream os; deba@127: os << value; deba@127: return os.str(); deba@127: } deba@127: }; deba@127: deba@127: template deba@127: bool operator<(const T&, const T&) { deba@127: throw DataFormatError("Label map is not comparable"); deba@127: } deba@127: deba@127: template deba@127: class MapLess { deba@127: public: deba@127: typedef _Map Map; deba@127: typedef typename Map::Key Item; deba@127: deba@127: private: deba@127: const Map& _map; deba@127: deba@127: public: deba@127: MapLess(const Map& map) : _map(map) {} deba@127: deba@127: bool operator()(const Item& left, const Item& right) { deba@127: return _map[left] < _map[right]; deba@127: } deba@127: }; deba@127: deba@165: template deba@165: class GraphArcMapLess { deba@165: public: deba@165: typedef _Map Map; deba@165: typedef _Graph Graph; deba@165: typedef typename Graph::Edge Item; deba@165: deba@165: private: deba@165: const Graph& _graph; deba@165: const Map& _map; deba@165: deba@165: public: deba@165: GraphArcMapLess(const Graph& graph, const Map& map) deba@165: : _graph(graph), _map(map) {} deba@165: deba@165: bool operator()(const Item& left, const Item& right) { deba@165: return _map[_graph.direct(left, _dir)] < deba@165: _map[_graph.direct(right, _dir)]; deba@165: } deba@165: }; deba@165: deba@127: template deba@127: class MapStorageBase { deba@127: public: deba@127: typedef _Item Item; deba@127: deba@127: public: deba@127: MapStorageBase() {} deba@127: virtual ~MapStorageBase() {} deba@127: deba@127: virtual std::string get(const Item& item) = 0; deba@127: virtual void sort(std::vector&) = 0; deba@127: }; deba@127: deba@127: template > deba@127: class MapStorage : public MapStorageBase<_Item> { deba@127: public: deba@127: typedef _Map Map; deba@127: typedef _Converter Converter; deba@127: typedef _Item Item; deba@127: deba@127: private: deba@127: const Map& _map; deba@127: Converter _converter; deba@127: deba@127: public: deba@127: MapStorage(const Map& map, const Converter& converter = Converter()) deba@127: : _map(map), _converter(converter) {} deba@127: virtual ~MapStorage() {} deba@127: deba@127: virtual std::string get(const Item& item) { deba@127: return _converter(_map[item]); deba@127: } deba@127: virtual void sort(std::vector& items) { deba@127: MapLess less(_map); deba@127: std::sort(items.begin(), items.end(), less); deba@127: } deba@127: }; deba@127: deba@165: template > deba@165: class GraphArcMapStorage : public MapStorageBase { deba@165: public: deba@165: typedef _Map Map; deba@165: typedef _Converter Converter; deba@165: typedef _Graph Graph; deba@165: typedef typename Graph::Edge Item; deba@165: static const bool dir = _dir; deba@165: deba@165: private: deba@165: const Graph& _graph; deba@165: const Map& _map; deba@165: Converter _converter; deba@165: deba@165: public: deba@165: GraphArcMapStorage(const Graph& graph, const Map& map, deba@165: const Converter& converter = Converter()) deba@165: : _graph(graph), _map(map), _converter(converter) {} deba@165: virtual ~GraphArcMapStorage() {} deba@165: deba@165: virtual std::string get(const Item& item) { deba@165: return _converter(_map[_graph.direct(item, dir)]); deba@165: } deba@165: virtual void sort(std::vector& items) { deba@165: GraphArcMapLess less(_graph, _map); deba@165: std::sort(items.begin(), items.end(), less); deba@165: } deba@165: }; deba@165: deba@127: class ValueStorageBase { deba@127: public: deba@127: ValueStorageBase() {} deba@127: virtual ~ValueStorageBase() {} deba@127: deba@127: virtual std::string get() = 0; deba@127: }; deba@127: deba@127: template > deba@127: class ValueStorage : public ValueStorageBase { deba@127: public: deba@127: typedef _Value Value; deba@127: typedef _Converter Converter; deba@127: deba@127: private: deba@127: const Value& _value; deba@127: Converter _converter; deba@127: deba@127: public: deba@127: ValueStorage(const Value& value, const Converter& converter = Converter()) deba@127: : _value(value), _converter(converter) {} deba@127: deba@127: virtual std::string get() { deba@127: return _converter(_value); deba@127: } deba@127: }; deba@127: deba@127: template deba@127: struct MapLookUpConverter { deba@127: const std::map& _map; deba@127: deba@127: MapLookUpConverter(const std::map& map) deba@127: : _map(map) {} deba@127: deba@127: std::string operator()(const Value& str) { deba@127: typename std::map::const_iterator it = deba@127: _map.find(str); deba@127: if (it == _map.end()) { deba@127: throw DataFormatError("Item not found"); deba@127: } deba@127: return it->second; deba@127: } deba@127: }; deba@127: deba@165: template deba@165: struct GraphArcLookUpConverter { deba@165: const Graph& _graph; deba@165: const std::map& _map; deba@165: deba@165: GraphArcLookUpConverter(const Graph& graph, deba@165: const std::map& map) deba@165: : _graph(graph), _map(map) {} deba@165: deba@165: std::string operator()(const typename Graph::Arc& val) { deba@165: typename std::map deba@165: ::const_iterator it = _map.find(val); deba@165: if (it == _map.end()) { deba@165: throw DataFormatError("Item not found"); deba@165: } deba@165: return (_graph.direction(val) ? '+' : '-') + it->second; deba@165: } deba@165: }; deba@165: deba@197: inline bool isWhiteSpace(char c) { deba@127: return c == ' ' || c == '\t' || c == '\v' || deba@127: c == '\n' || c == '\r' || c == '\f'; deba@127: } deba@127: deba@197: inline bool isEscaped(char c) { deba@127: return c == '\\' || c == '\"' || c == '\'' || deba@127: c == '\a' || c == '\b'; deba@127: } deba@127: deba@197: inline static void writeEscape(std::ostream& os, char c) { deba@127: switch (c) { deba@127: case '\\': deba@127: os << "\\\\"; deba@127: return; deba@127: case '\"': deba@127: os << "\\\""; deba@127: return; deba@127: case '\a': deba@127: os << "\\a"; deba@127: return; deba@127: case '\b': deba@127: os << "\\b"; deba@127: return; deba@127: case '\f': deba@127: os << "\\f"; deba@127: return; deba@127: case '\r': deba@127: os << "\\r"; deba@127: return; deba@127: case '\n': deba@127: os << "\\n"; deba@127: return; deba@127: case '\t': deba@127: os << "\\t"; deba@127: return; deba@127: case '\v': deba@127: os << "\\v"; deba@127: return; deba@127: default: deba@127: if (c < 0x20) { deba@163: std::ios::fmtflags flags = os.flags(); deba@127: os << '\\' << std::oct << static_cast(c); deba@163: os.flags(flags); deba@127: } else { deba@127: os << c; deba@127: } deba@127: return; deba@127: } deba@127: } deba@127: deba@197: inline bool requireEscape(const std::string& str) { alpar@156: if (str.empty() || str[0] == '@') return true; deba@127: std::istringstream is(str); deba@127: char c; deba@127: while (is.get(c)) { deba@127: if (isWhiteSpace(c) || isEscaped(c)) { deba@127: return true; deba@127: } deba@127: } deba@127: return false; deba@127: } deba@127: deba@197: inline std::ostream& writeToken(std::ostream& os, const std::string& str) { deba@127: deba@127: if (requireEscape(str)) { deba@127: os << '\"'; deba@127: for (std::string::const_iterator it = str.begin(); deba@127: it != str.end(); ++it) { deba@127: writeEscape(os, *it); deba@127: } deba@127: os << '\"'; deba@127: } else { deba@127: os << str; deba@127: } deba@127: return os; deba@127: } deba@127: deba@127: } deba@190: deba@190: template deba@190: class DigraphWriter; deba@190: deba@190: template deba@190: DigraphWriter digraphWriter(std::ostream& os, deba@190: const Digraph& digraph); deba@190: deba@190: template deba@190: DigraphWriter digraphWriter(const std::string& fn, deba@190: const Digraph& digraph); deba@190: deba@190: template deba@190: DigraphWriter digraphWriter(const char *fn, deba@190: const Digraph& digraph); deba@127: alpar@156: /// \ingroup lemon_io alpar@156: /// kpeter@192: /// \brief \ref lgf-format "LGF" writer for directed graphs alpar@156: /// alpar@156: /// This utility writes an \ref lgf-format "LGF" file. alpar@156: /// alpar@156: /// The writing method does a batch processing. The user creates a alpar@156: /// writer object, then various writing rules can be added to the alpar@156: /// writer, and eventually the writing is executed with the \c run() alpar@156: /// member function. A map writing rule can be added to the writer alpar@156: /// with the \c nodeMap() or \c arcMap() members. An optional deba@163: /// converter parameter can also be added as a standard functor kpeter@192: /// converting from the value type of the map to \c std::string. If it kpeter@192: /// is set, it will determine how the value type of the map is written to deba@163: /// the output stream. If the functor is not set, then a default deba@163: /// conversion will be used. The \c attribute(), \c node() and \c deba@163: /// arc() functions are used to add attribute writing rules. alpar@156: /// alpar@156: ///\code kpeter@192: /// DigraphWriter(std::cout, digraph). kpeter@192: /// nodeMap("coordinates", coord_map). kpeter@192: /// nodeMap("size", size). kpeter@192: /// nodeMap("title", title). kpeter@192: /// arcMap("capacity", cap_map). kpeter@192: /// node("source", src). kpeter@192: /// node("target", trg). kpeter@192: /// attribute("caption", caption). kpeter@192: /// run(); alpar@156: ///\endcode alpar@156: /// alpar@156: /// alpar@156: /// By default, the writer does not write additional captions to the alpar@156: /// sections, but they can be give as an optional parameter of alpar@156: /// the \c nodes(), \c arcs() or \c alpar@156: /// attributes() functions. alpar@156: /// alpar@156: /// The \c skipNodes() and \c skipArcs() functions forbid the deba@163: /// writing of the sections. If two arc sections should be written deba@163: /// to the output, it can be done in two passes, the first pass deba@163: /// writes the node section and the first arc section, then the deba@163: /// second pass skips the node section and writes just the arc deba@163: /// section to the stream. The output stream can be retrieved with deba@163: /// the \c ostream() function, hence the second pass can append its deba@163: /// output to the output of the first pass. deba@127: template deba@127: class DigraphWriter { deba@127: public: deba@127: deba@127: typedef _Digraph Digraph; deba@148: TEMPLATE_DIGRAPH_TYPEDEFS(Digraph); deba@127: deba@127: private: deba@127: deba@127: deba@127: std::ostream* _os; deba@127: bool local_os; deba@127: deba@190: const Digraph& _digraph; deba@127: deba@127: std::string _nodes_caption; deba@127: std::string _arcs_caption; deba@127: std::string _attributes_caption; deba@127: deba@127: typedef std::map NodeIndex; deba@127: NodeIndex _node_index; deba@127: typedef std::map ArcIndex; deba@127: ArcIndex _arc_index; deba@127: deba@127: typedef std::vector* > > NodeMaps; deba@127: NodeMaps _node_maps; deba@127: deba@127: typedef std::vector* > >ArcMaps; deba@127: ArcMaps _arc_maps; deba@127: deba@127: typedef std::vector > Attributes; deba@127: Attributes _attributes; deba@127: deba@127: bool _skip_nodes; deba@127: bool _skip_arcs; deba@127: deba@127: public: deba@127: alpar@156: /// \brief Constructor alpar@156: /// alpar@156: /// Construct a directed graph writer, which writes to the given alpar@156: /// output stream. deba@190: DigraphWriter(std::ostream& is, const Digraph& digraph) deba@127: : _os(&is), local_os(false), _digraph(digraph), deba@127: _skip_nodes(false), _skip_arcs(false) {} deba@127: alpar@156: /// \brief Constructor alpar@156: /// alpar@156: /// Construct a directed graph writer, which writes to the given alpar@156: /// output file. deba@190: DigraphWriter(const std::string& fn, const Digraph& digraph) deba@127: : _os(new std::ofstream(fn.c_str())), local_os(true), _digraph(digraph), deba@127: _skip_nodes(false), _skip_arcs(false) {} deba@127: alpar@156: /// \brief Constructor alpar@156: /// alpar@156: /// Construct a directed graph writer, which writes to the given alpar@156: /// output file. deba@190: DigraphWriter(const char* fn, const Digraph& digraph) deba@127: : _os(new std::ofstream(fn)), local_os(true), _digraph(digraph), deba@127: _skip_nodes(false), _skip_arcs(false) {} deba@127: alpar@156: /// \brief Destructor deba@127: ~DigraphWriter() { deba@127: for (typename NodeMaps::iterator it = _node_maps.begin(); deba@127: it != _node_maps.end(); ++it) { deba@127: delete it->second; deba@127: } deba@127: deba@127: for (typename ArcMaps::iterator it = _arc_maps.begin(); deba@127: it != _arc_maps.end(); ++it) { deba@127: delete it->second; deba@127: } deba@127: deba@127: for (typename Attributes::iterator it = _attributes.begin(); deba@127: it != _attributes.end(); ++it) { deba@127: delete it->second; deba@127: } deba@127: deba@127: if (local_os) { deba@127: delete _os; deba@127: } deba@127: } deba@127: deba@127: private: deba@190: deba@190: friend DigraphWriter digraphWriter<>(std::ostream& os, deba@190: const Digraph& digraph); deba@190: friend DigraphWriter digraphWriter<>(const std::string& fn, deba@190: const Digraph& digraph); deba@190: friend DigraphWriter digraphWriter<>(const char *fn, deba@190: const Digraph& digraph); deba@190: deba@190: DigraphWriter(DigraphWriter& other) deba@190: : _os(other._os), local_os(other.local_os), _digraph(other._digraph), deba@190: _skip_nodes(other._skip_nodes), _skip_arcs(other._skip_arcs) { deba@190: deba@190: other._os = 0; deba@190: other.local_os = false; deba@190: deba@190: _node_index.swap(other._node_index); deba@190: _arc_index.swap(other._arc_index); deba@190: deba@190: _node_maps.swap(other._node_maps); deba@190: _arc_maps.swap(other._arc_maps); deba@190: _attributes.swap(other._attributes); deba@190: deba@190: _nodes_caption = other._nodes_caption; deba@190: _arcs_caption = other._arcs_caption; deba@190: _attributes_caption = other._attributes_caption; deba@190: } deba@127: deba@127: DigraphWriter& operator=(const DigraphWriter&); deba@127: deba@127: public: deba@127: alpar@156: /// \name Writing rules alpar@156: /// @{ alpar@156: kpeter@192: /// \brief Node map writing rule alpar@156: /// kpeter@192: /// Add a node map writing rule to the writer. deba@127: template deba@127: DigraphWriter& nodeMap(const std::string& caption, const Map& map) { deba@127: checkConcept, Map>(); deba@127: _writer_bits::MapStorageBase* storage = deba@127: new _writer_bits::MapStorage(map); deba@127: _node_maps.push_back(std::make_pair(caption, storage)); deba@127: return *this; deba@127: } deba@127: alpar@156: /// \brief Node map writing rule alpar@156: /// alpar@156: /// Add a node map writing rule with specialized converter to the alpar@156: /// writer. deba@127: template deba@127: DigraphWriter& nodeMap(const std::string& caption, const Map& map, deba@127: const Converter& converter = Converter()) { deba@127: checkConcept, Map>(); deba@127: _writer_bits::MapStorageBase* storage = deba@127: new _writer_bits::MapStorage(map, converter); deba@127: _node_maps.push_back(std::make_pair(caption, storage)); deba@127: return *this; deba@127: } deba@127: alpar@156: /// \brief Arc map writing rule alpar@156: /// alpar@156: /// Add an arc map writing rule to the writer. deba@127: template deba@127: DigraphWriter& arcMap(const std::string& caption, const Map& map) { deba@127: checkConcept, Map>(); deba@127: _writer_bits::MapStorageBase* storage = deba@127: new _writer_bits::MapStorage(map); deba@127: _arc_maps.push_back(std::make_pair(caption, storage)); deba@127: return *this; deba@127: } deba@127: alpar@156: /// \brief Arc map writing rule alpar@156: /// alpar@156: /// Add an arc map writing rule with specialized converter to the alpar@156: /// writer. deba@127: template deba@127: DigraphWriter& arcMap(const std::string& caption, const Map& map, deba@127: const Converter& converter = Converter()) { deba@127: checkConcept, Map>(); deba@127: _writer_bits::MapStorageBase* storage = deba@127: new _writer_bits::MapStorage(map, converter); deba@127: _arc_maps.push_back(std::make_pair(caption, storage)); deba@127: return *this; deba@127: } deba@127: alpar@156: /// \brief Attribute writing rule alpar@156: /// alpar@156: /// Add an attribute writing rule to the writer. deba@127: template deba@127: DigraphWriter& attribute(const std::string& caption, const Value& value) { deba@127: _writer_bits::ValueStorageBase* storage = deba@127: new _writer_bits::ValueStorage(value); deba@127: _attributes.push_back(std::make_pair(caption, storage)); deba@127: return *this; deba@127: } deba@127: alpar@156: /// \brief Attribute writing rule alpar@156: /// alpar@156: /// Add an attribute writing rule with specialized converter to the alpar@156: /// writer. deba@127: template deba@127: DigraphWriter& attribute(const std::string& caption, const Value& value, deba@127: const Converter& converter = Converter()) { deba@127: _writer_bits::ValueStorageBase* storage = deba@127: new _writer_bits::ValueStorage(value, converter); deba@127: _attributes.push_back(std::make_pair(caption, storage)); deba@127: return *this; deba@127: } deba@127: alpar@156: /// \brief Node writing rule alpar@156: /// alpar@156: /// Add a node writing rule to the writer. deba@127: DigraphWriter& node(const std::string& caption, const Node& node) { deba@127: typedef _writer_bits::MapLookUpConverter Converter; deba@127: Converter converter(_node_index); deba@127: _writer_bits::ValueStorageBase* storage = deba@127: new _writer_bits::ValueStorage(node, converter); deba@127: _attributes.push_back(std::make_pair(caption, storage)); deba@127: return *this; deba@127: } deba@127: alpar@156: /// \brief Arc writing rule alpar@156: /// alpar@156: /// Add an arc writing rule to writer. deba@127: DigraphWriter& arc(const std::string& caption, const Arc& arc) { deba@127: typedef _writer_bits::MapLookUpConverter Converter; deba@127: Converter converter(_arc_index); deba@127: _writer_bits::ValueStorageBase* storage = deba@127: new _writer_bits::ValueStorage(arc, converter); deba@127: _attributes.push_back(std::make_pair(caption, storage)); deba@127: return *this; deba@127: } deba@127: kpeter@192: /// \name Section captions alpar@156: /// @{ alpar@156: kpeter@192: /// \brief Add an additional caption to the \c \@nodes section alpar@156: /// kpeter@192: /// Add an additional caption to the \c \@nodes section. deba@127: DigraphWriter& nodes(const std::string& caption) { deba@127: _nodes_caption = caption; deba@127: return *this; deba@127: } deba@127: kpeter@192: /// \brief Add an additional caption to the \c \@arcs section alpar@156: /// kpeter@192: /// Add an additional caption to the \c \@arcs section. deba@127: DigraphWriter& arcs(const std::string& caption) { deba@127: _arcs_caption = caption; deba@127: return *this; deba@127: } deba@127: kpeter@192: /// \brief Add an additional caption to the \c \@attributes section alpar@156: /// kpeter@192: /// Add an additional caption to the \c \@attributes section. deba@127: DigraphWriter& attributes(const std::string& caption) { deba@127: _attributes_caption = caption; deba@127: return *this; deba@127: } deba@127: alpar@156: /// \name Skipping section alpar@156: /// @{ alpar@156: alpar@156: /// \brief Skip writing the node set alpar@156: /// kpeter@192: /// The \c \@nodes section will not be written to the stream. deba@127: DigraphWriter& skipNodes() { deba@127: LEMON_ASSERT(!_skip_nodes, "Multiple usage of skipNodes() member"); deba@185: _skip_nodes = true; deba@127: return *this; deba@127: } deba@127: alpar@156: /// \brief Skip writing arc set alpar@156: /// kpeter@192: /// The \c \@arcs section will not be written to the stream. deba@127: DigraphWriter& skipArcs() { deba@127: LEMON_ASSERT(!_skip_arcs, "Multiple usage of skipArcs() member"); deba@185: _skip_arcs = true; deba@127: return *this; deba@127: } deba@127: alpar@156: /// @} alpar@156: deba@127: private: deba@127: deba@127: void writeNodes() { deba@127: _writer_bits::MapStorageBase* label = 0; deba@127: for (typename NodeMaps::iterator it = _node_maps.begin(); deba@127: it != _node_maps.end(); ++it) { deba@127: if (it->first == "label") { deba@127: label = it->second; deba@127: break; deba@127: } deba@127: } deba@127: deba@127: *_os << "@nodes"; deba@127: if (!_nodes_caption.empty()) { alpar@156: _writer_bits::writeToken(*_os << ' ', _nodes_caption); deba@127: } deba@127: *_os << std::endl; deba@127: deba@127: if (label == 0) { deba@127: *_os << "label" << '\t'; deba@127: } deba@127: for (typename NodeMaps::iterator it = _node_maps.begin(); deba@127: it != _node_maps.end(); ++it) { alpar@156: _writer_bits::writeToken(*_os, it->first) << '\t'; deba@127: } deba@127: *_os << std::endl; deba@127: deba@127: std::vector nodes; deba@127: for (NodeIt n(_digraph); n != INVALID; ++n) { deba@127: nodes.push_back(n); deba@127: } deba@127: deba@127: if (label == 0) { deba@127: IdMap id_map(_digraph); deba@127: _writer_bits::MapLess > id_less(id_map); deba@127: std::sort(nodes.begin(), nodes.end(), id_less); deba@127: } else { deba@127: label->sort(nodes); deba@127: } deba@127: deba@127: for (int i = 0; i < static_cast(nodes.size()); ++i) { deba@127: Node n = nodes[i]; deba@127: if (label == 0) { deba@127: std::ostringstream os; deba@127: os << _digraph.id(n); deba@127: _writer_bits::writeToken(*_os, os.str()); deba@127: *_os << '\t'; deba@127: _node_index.insert(std::make_pair(n, os.str())); deba@127: } deba@127: for (typename NodeMaps::iterator it = _node_maps.begin(); deba@127: it != _node_maps.end(); ++it) { deba@127: std::string value = it->second->get(n); deba@127: _writer_bits::writeToken(*_os, value); deba@127: if (it->first == "label") { deba@127: _node_index.insert(std::make_pair(n, value)); deba@127: } deba@127: *_os << '\t'; deba@127: } deba@127: *_os << std::endl; deba@127: } deba@127: } deba@127: deba@185: void createNodeIndex() { deba@185: _writer_bits::MapStorageBase* label = 0; deba@185: for (typename NodeMaps::iterator it = _node_maps.begin(); deba@185: it != _node_maps.end(); ++it) { deba@185: if (it->first == "label") { deba@185: label = it->second; deba@185: break; deba@185: } deba@185: } deba@185: deba@185: if (label == 0) { deba@185: for (NodeIt n(_digraph); n != INVALID; ++n) { deba@185: std::ostringstream os; deba@185: os << _digraph.id(n); deba@185: _node_index.insert(std::make_pair(n, os.str())); deba@185: } deba@185: } else { deba@185: for (NodeIt n(_digraph); n != INVALID; ++n) { deba@185: std::string value = label->get(n); deba@185: _node_index.insert(std::make_pair(n, value)); deba@185: } deba@185: } deba@185: } deba@185: deba@127: void writeArcs() { deba@127: _writer_bits::MapStorageBase* label = 0; deba@127: for (typename ArcMaps::iterator it = _arc_maps.begin(); deba@127: it != _arc_maps.end(); ++it) { deba@127: if (it->first == "label") { deba@127: label = it->second; deba@127: break; deba@127: } deba@127: } deba@127: deba@127: *_os << "@arcs"; deba@127: if (!_arcs_caption.empty()) { alpar@156: _writer_bits::writeToken(*_os << ' ', _arcs_caption); deba@127: } deba@127: *_os << std::endl; deba@127: deba@127: *_os << '\t' << '\t'; deba@127: if (label == 0) { deba@127: *_os << "label" << '\t'; deba@127: } deba@127: for (typename ArcMaps::iterator it = _arc_maps.begin(); deba@127: it != _arc_maps.end(); ++it) { alpar@156: _writer_bits::writeToken(*_os, it->first) << '\t'; deba@127: } deba@127: *_os << std::endl; deba@127: deba@127: std::vector arcs; deba@127: for (ArcIt n(_digraph); n != INVALID; ++n) { deba@127: arcs.push_back(n); deba@127: } deba@127: deba@127: if (label == 0) { deba@127: IdMap id_map(_digraph); deba@127: _writer_bits::MapLess > id_less(id_map); deba@127: std::sort(arcs.begin(), arcs.end(), id_less); deba@127: } else { deba@127: label->sort(arcs); deba@127: } deba@127: deba@127: for (int i = 0; i < static_cast(arcs.size()); ++i) { deba@127: Arc a = arcs[i]; deba@127: _writer_bits::writeToken(*_os, _node_index. deba@127: find(_digraph.source(a))->second); deba@127: *_os << '\t'; deba@127: _writer_bits::writeToken(*_os, _node_index. deba@127: find(_digraph.target(a))->second); deba@127: *_os << '\t'; deba@127: if (label == 0) { deba@127: std::ostringstream os; deba@127: os << _digraph.id(a); deba@127: _writer_bits::writeToken(*_os, os.str()); deba@127: *_os << '\t'; deba@127: _arc_index.insert(std::make_pair(a, os.str())); deba@127: } deba@127: for (typename ArcMaps::iterator it = _arc_maps.begin(); deba@127: it != _arc_maps.end(); ++it) { deba@127: std::string value = it->second->get(a); deba@127: _writer_bits::writeToken(*_os, value); deba@127: if (it->first == "label") { deba@127: _arc_index.insert(std::make_pair(a, value)); deba@127: } deba@127: *_os << '\t'; deba@127: } deba@127: *_os << std::endl; deba@127: } deba@127: } deba@127: deba@185: void createArcIndex() { deba@185: _writer_bits::MapStorageBase* label = 0; deba@185: for (typename ArcMaps::iterator it = _arc_maps.begin(); deba@185: it != _arc_maps.end(); ++it) { deba@185: if (it->first == "label") { deba@185: label = it->second; deba@185: break; deba@185: } deba@185: } deba@185: deba@185: if (label == 0) { deba@185: for (ArcIt a(_digraph); a != INVALID; ++a) { deba@185: std::ostringstream os; deba@185: os << _digraph.id(a); deba@185: _arc_index.insert(std::make_pair(a, os.str())); deba@185: } deba@185: } else { deba@185: for (ArcIt a(_digraph); a != INVALID; ++a) { deba@185: std::string value = label->get(a); deba@185: _arc_index.insert(std::make_pair(a, value)); deba@185: } deba@185: } deba@185: } deba@185: deba@127: void writeAttributes() { deba@127: if (_attributes.empty()) return; deba@127: *_os << "@attributes"; deba@127: if (!_attributes_caption.empty()) { alpar@156: _writer_bits::writeToken(*_os << ' ', _attributes_caption); deba@127: } deba@127: *_os << std::endl; deba@127: for (typename Attributes::iterator it = _attributes.begin(); deba@127: it != _attributes.end(); ++it) { alpar@156: _writer_bits::writeToken(*_os, it->first) << ' '; deba@127: _writer_bits::writeToken(*_os, it->second->get()); deba@127: *_os << std::endl; deba@127: } deba@127: } deba@127: deba@127: public: deba@127: alpar@156: /// \name Execution of the writer alpar@156: /// @{ alpar@156: alpar@156: /// \brief Start the batch processing alpar@156: /// kpeter@192: /// This function starts the batch processing. deba@127: void run() { deba@127: if (!_skip_nodes) { deba@127: writeNodes(); deba@185: } else { deba@185: createNodeIndex(); deba@127: } deba@127: if (!_skip_arcs) { deba@127: writeArcs(); deba@185: } else { deba@185: createArcIndex(); deba@127: } deba@127: writeAttributes(); deba@127: } deba@127: kpeter@192: /// \brief Give back the stream of the writer alpar@156: /// kpeter@192: /// Give back the stream of the writer. alpar@156: std::ostream& ostream() { deba@127: return *_os; deba@127: } alpar@156: alpar@156: /// @} deba@127: }; deba@127: kpeter@192: /// \brief Return a \ref DigraphWriter class kpeter@192: /// kpeter@192: /// This function just returns a \ref DigraphWriter class. alpar@156: /// \relates DigraphWriter deba@127: template deba@190: DigraphWriter digraphWriter(std::ostream& os, deba@190: const Digraph& digraph) { deba@163: DigraphWriter tmp(os, digraph); deba@163: return tmp; deba@127: } deba@127: kpeter@192: /// \brief Return a \ref DigraphWriter class kpeter@192: /// kpeter@192: /// This function just returns a \ref DigraphWriter class. alpar@156: /// \relates DigraphWriter deba@127: template deba@127: DigraphWriter digraphWriter(const std::string& fn, deba@190: const Digraph& digraph) { deba@163: DigraphWriter tmp(fn, digraph); deba@163: return tmp; deba@127: } deba@127: kpeter@192: /// \brief Return a \ref DigraphWriter class kpeter@192: /// kpeter@192: /// This function just returns a \ref DigraphWriter class. alpar@156: /// \relates DigraphWriter deba@127: template deba@190: DigraphWriter digraphWriter(const char* fn, deba@190: const Digraph& digraph) { deba@163: DigraphWriter tmp(fn, digraph); deba@163: return tmp; deba@127: } deba@165: deba@190: template deba@190: class GraphWriter; deba@190: deba@190: template deba@190: GraphWriter graphWriter(std::ostream& os, const Graph& graph); deba@190: deba@190: template deba@190: GraphWriter graphWriter(const std::string& fn, const Graph& graph); deba@190: deba@190: template deba@190: GraphWriter graphWriter(const char *fn, const Graph& graph); deba@190: deba@165: /// \ingroup lemon_io deba@165: /// kpeter@192: /// \brief \ref lgf-format "LGF" writer for directed graphs deba@165: /// deba@165: /// This utility writes an \ref lgf-format "LGF" file. kpeter@192: /// kpeter@192: /// It can be used almost the same way as \c DigraphWriter. kpeter@192: /// The only difference is that this class can handle edges and kpeter@192: /// edge maps as well as arcs and arc maps. deba@201: /// deba@201: /// The arc maps are written into the file as two columns, the deba@201: /// caption of the columns are the name of the map prefixed with \c deba@201: /// '+' and \c '-'. The arcs are written into the \c \@attributes deba@201: /// section as a \c '+' or a \c '-' prefix (depends on the direction deba@201: /// of the arc) and the label of corresponding edge. deba@165: template deba@165: class GraphWriter { deba@165: public: deba@165: deba@165: typedef _Graph Graph; deba@165: TEMPLATE_GRAPH_TYPEDEFS(Graph); deba@165: deba@165: private: deba@165: deba@165: deba@165: std::ostream* _os; deba@165: bool local_os; deba@165: deba@165: Graph& _graph; deba@165: deba@165: std::string _nodes_caption; deba@165: std::string _edges_caption; deba@165: std::string _attributes_caption; deba@165: deba@165: typedef std::map NodeIndex; deba@165: NodeIndex _node_index; deba@165: typedef std::map EdgeIndex; deba@165: EdgeIndex _edge_index; deba@165: deba@165: typedef std::vector* > > NodeMaps; deba@165: NodeMaps _node_maps; deba@165: deba@165: typedef std::vector* > >EdgeMaps; deba@165: EdgeMaps _edge_maps; deba@165: deba@165: typedef std::vector > Attributes; deba@165: Attributes _attributes; deba@165: deba@165: bool _skip_nodes; deba@165: bool _skip_edges; deba@165: deba@165: public: deba@165: deba@165: /// \brief Constructor deba@165: /// deba@165: /// Construct a directed graph writer, which writes to the given deba@165: /// output stream. deba@190: GraphWriter(std::ostream& is, const Graph& graph) deba@165: : _os(&is), local_os(false), _graph(graph), deba@165: _skip_nodes(false), _skip_edges(false) {} deba@165: deba@165: /// \brief Constructor deba@165: /// deba@165: /// Construct a directed graph writer, which writes to the given deba@165: /// output file. deba@190: GraphWriter(const std::string& fn, const Graph& graph) deba@165: : _os(new std::ofstream(fn.c_str())), local_os(true), _graph(graph), deba@165: _skip_nodes(false), _skip_edges(false) {} deba@165: deba@165: /// \brief Constructor deba@165: /// deba@165: /// Construct a directed graph writer, which writes to the given deba@165: /// output file. deba@190: GraphWriter(const char* fn, const Graph& graph) deba@165: : _os(new std::ofstream(fn)), local_os(true), _graph(graph), deba@165: _skip_nodes(false), _skip_edges(false) {} deba@165: deba@165: /// \brief Destructor deba@165: ~GraphWriter() { deba@165: for (typename NodeMaps::iterator it = _node_maps.begin(); deba@165: it != _node_maps.end(); ++it) { deba@165: delete it->second; deba@165: } deba@165: deba@165: for (typename EdgeMaps::iterator it = _edge_maps.begin(); deba@165: it != _edge_maps.end(); ++it) { deba@165: delete it->second; deba@165: } deba@165: deba@165: for (typename Attributes::iterator it = _attributes.begin(); deba@165: it != _attributes.end(); ++it) { deba@165: delete it->second; deba@165: } deba@165: deba@165: if (local_os) { deba@165: delete _os; deba@165: } deba@165: } deba@190: deba@190: private: deba@165: deba@190: friend GraphWriter graphWriter<>(std::ostream& os, deba@190: const Graph& graph); deba@190: friend GraphWriter graphWriter<>(const std::string& fn, deba@190: const Graph& graph); deba@190: friend GraphWriter graphWriter<>(const char *fn, deba@190: const Graph& graph); deba@190: deba@190: GraphWriter(GraphWriter& other) deba@190: : _os(other._os), local_os(other.local_os), _graph(other._graph), deba@190: _skip_nodes(other._skip_nodes), _skip_edges(other._skip_edges) { deba@190: deba@190: other._os = 0; deba@190: other.local_os = false; deba@190: deba@190: _node_index.swap(other._node_index); deba@190: _edge_index.swap(other._edge_index); deba@190: deba@190: _node_maps.swap(other._node_maps); deba@190: _edge_maps.swap(other._edge_maps); deba@190: _attributes.swap(other._attributes); deba@190: deba@190: _nodes_caption = other._nodes_caption; deba@190: _edges_caption = other._edges_caption; deba@190: _attributes_caption = other._attributes_caption; deba@190: } deba@190: deba@165: GraphWriter& operator=(const GraphWriter&); deba@165: deba@165: public: deba@165: deba@165: /// \name Writing rules deba@165: /// @{ deba@165: kpeter@192: /// \brief Node map writing rule deba@165: /// kpeter@192: /// Add a node map writing rule to the writer. deba@165: template deba@165: GraphWriter& nodeMap(const std::string& caption, const Map& map) { deba@165: checkConcept, Map>(); deba@165: _writer_bits::MapStorageBase* storage = deba@165: new _writer_bits::MapStorage(map); deba@165: _node_maps.push_back(std::make_pair(caption, storage)); deba@165: return *this; deba@165: } deba@165: deba@165: /// \brief Node map writing rule deba@165: /// deba@165: /// Add a node map writing rule with specialized converter to the deba@165: /// writer. deba@165: template deba@165: GraphWriter& nodeMap(const std::string& caption, const Map& map, deba@165: const Converter& converter = Converter()) { deba@165: checkConcept, Map>(); deba@165: _writer_bits::MapStorageBase* storage = deba@165: new _writer_bits::MapStorage(map, converter); deba@165: _node_maps.push_back(std::make_pair(caption, storage)); deba@165: return *this; deba@165: } deba@165: deba@165: /// \brief Edge map writing rule deba@165: /// deba@165: /// Add an edge map writing rule to the writer. deba@165: template deba@165: GraphWriter& edgeMap(const std::string& caption, const Map& map) { deba@165: checkConcept, Map>(); deba@165: _writer_bits::MapStorageBase* storage = deba@165: new _writer_bits::MapStorage(map); deba@165: _edge_maps.push_back(std::make_pair(caption, storage)); deba@165: return *this; deba@165: } deba@165: deba@165: /// \brief Edge map writing rule deba@165: /// deba@165: /// Add an edge map writing rule with specialized converter to the deba@165: /// writer. deba@165: template deba@165: GraphWriter& edgeMap(const std::string& caption, const Map& map, deba@165: const Converter& converter = Converter()) { deba@165: checkConcept, Map>(); deba@165: _writer_bits::MapStorageBase* storage = deba@165: new _writer_bits::MapStorage(map, converter); deba@165: _edge_maps.push_back(std::make_pair(caption, storage)); deba@165: return *this; deba@165: } deba@165: deba@165: /// \brief Arc map writing rule deba@165: /// deba@165: /// Add an arc map writing rule to the writer. deba@165: template deba@165: GraphWriter& arcMap(const std::string& caption, const Map& map) { deba@165: checkConcept, Map>(); deba@165: _writer_bits::MapStorageBase* forward_storage = deba@165: new _writer_bits::GraphArcMapStorage(_graph, map); deba@165: _edge_maps.push_back(std::make_pair('+' + caption, forward_storage)); deba@165: _writer_bits::MapStorageBase* backward_storage = deba@165: new _writer_bits::GraphArcMapStorage(_graph, map); deba@165: _edge_maps.push_back(std::make_pair('-' + caption, backward_storage)); deba@165: return *this; deba@165: } deba@165: deba@165: /// \brief Arc map writing rule deba@165: /// deba@165: /// Add an arc map writing rule with specialized converter to the deba@165: /// writer. deba@165: template deba@165: GraphWriter& arcMap(const std::string& caption, const Map& map, deba@165: const Converter& converter = Converter()) { deba@165: checkConcept, Map>(); deba@165: _writer_bits::MapStorageBase* forward_storage = deba@165: new _writer_bits::GraphArcMapStorage deba@165: (_graph, map, converter); deba@165: _edge_maps.push_back(std::make_pair('+' + caption, forward_storage)); deba@165: _writer_bits::MapStorageBase* backward_storage = deba@165: new _writer_bits::GraphArcMapStorage deba@165: (_graph, map, converter); deba@165: _edge_maps.push_back(std::make_pair('-' + caption, backward_storage)); deba@165: return *this; deba@165: } deba@165: deba@165: /// \brief Attribute writing rule deba@165: /// deba@165: /// Add an attribute writing rule to the writer. deba@165: template deba@165: GraphWriter& attribute(const std::string& caption, const Value& value) { deba@165: _writer_bits::ValueStorageBase* storage = deba@165: new _writer_bits::ValueStorage(value); deba@165: _attributes.push_back(std::make_pair(caption, storage)); deba@165: return *this; deba@165: } deba@165: deba@165: /// \brief Attribute writing rule deba@165: /// deba@165: /// Add an attribute writing rule with specialized converter to the deba@165: /// writer. deba@165: template deba@165: GraphWriter& attribute(const std::string& caption, const Value& value, deba@165: const Converter& converter = Converter()) { deba@165: _writer_bits::ValueStorageBase* storage = deba@165: new _writer_bits::ValueStorage(value, converter); deba@165: _attributes.push_back(std::make_pair(caption, storage)); deba@165: return *this; deba@165: } deba@165: deba@165: /// \brief Node writing rule deba@165: /// deba@165: /// Add a node writing rule to the writer. deba@165: GraphWriter& node(const std::string& caption, const Node& node) { deba@165: typedef _writer_bits::MapLookUpConverter Converter; deba@165: Converter converter(_node_index); deba@165: _writer_bits::ValueStorageBase* storage = deba@165: new _writer_bits::ValueStorage(node, converter); deba@165: _attributes.push_back(std::make_pair(caption, storage)); deba@165: return *this; deba@165: } deba@165: deba@165: /// \brief Edge writing rule deba@165: /// deba@165: /// Add an edge writing rule to writer. deba@165: GraphWriter& edge(const std::string& caption, const Edge& edge) { deba@165: typedef _writer_bits::MapLookUpConverter Converter; deba@165: Converter converter(_edge_index); deba@165: _writer_bits::ValueStorageBase* storage = deba@165: new _writer_bits::ValueStorage(edge, converter); deba@165: _attributes.push_back(std::make_pair(caption, storage)); deba@165: return *this; deba@165: } deba@165: deba@165: /// \brief Arc writing rule deba@165: /// deba@165: /// Add an arc writing rule to writer. deba@165: GraphWriter& arc(const std::string& caption, const Arc& arc) { deba@165: typedef _writer_bits::GraphArcLookUpConverter Converter; deba@165: Converter converter(_graph, _edge_index); deba@165: _writer_bits::ValueStorageBase* storage = deba@165: new _writer_bits::ValueStorage(arc, converter); deba@165: _attributes.push_back(std::make_pair(caption, storage)); deba@165: return *this; deba@165: } deba@165: kpeter@192: /// \name Section captions deba@165: /// @{ deba@165: kpeter@192: /// \brief Add an additional caption to the \c \@nodes section deba@165: /// kpeter@192: /// Add an additional caption to the \c \@nodes section. deba@165: GraphWriter& nodes(const std::string& caption) { deba@165: _nodes_caption = caption; deba@165: return *this; deba@165: } deba@165: kpeter@192: /// \brief Add an additional caption to the \c \@arcs section deba@165: /// kpeter@192: /// Add an additional caption to the \c \@arcs section. deba@165: GraphWriter& edges(const std::string& caption) { deba@165: _edges_caption = caption; deba@165: return *this; deba@165: } deba@165: kpeter@192: /// \brief Add an additional caption to the \c \@attributes section deba@165: /// kpeter@192: /// Add an additional caption to the \c \@attributes section. deba@165: GraphWriter& attributes(const std::string& caption) { deba@165: _attributes_caption = caption; deba@165: return *this; deba@165: } deba@165: deba@165: /// \name Skipping section deba@165: /// @{ deba@165: deba@165: /// \brief Skip writing the node set deba@165: /// kpeter@192: /// The \c \@nodes section will not be written to the stream. deba@165: GraphWriter& skipNodes() { deba@165: LEMON_ASSERT(!_skip_nodes, "Multiple usage of skipNodes() member"); deba@185: _skip_nodes = true; deba@165: return *this; deba@165: } deba@165: deba@165: /// \brief Skip writing edge set deba@165: /// kpeter@192: /// The \c \@edges section will not be written to the stream. deba@165: GraphWriter& skipEdges() { deba@165: LEMON_ASSERT(!_skip_edges, "Multiple usage of skipEdges() member"); deba@185: _skip_edges = true; deba@165: return *this; deba@165: } deba@165: deba@165: /// @} deba@165: deba@165: private: deba@165: deba@165: void writeNodes() { deba@165: _writer_bits::MapStorageBase* label = 0; deba@165: for (typename NodeMaps::iterator it = _node_maps.begin(); deba@165: it != _node_maps.end(); ++it) { deba@165: if (it->first == "label") { deba@165: label = it->second; deba@165: break; deba@165: } deba@165: } deba@165: deba@165: *_os << "@nodes"; deba@165: if (!_nodes_caption.empty()) { deba@165: _writer_bits::writeToken(*_os << ' ', _nodes_caption); deba@165: } deba@165: *_os << std::endl; deba@165: deba@165: if (label == 0) { deba@165: *_os << "label" << '\t'; deba@165: } deba@165: for (typename NodeMaps::iterator it = _node_maps.begin(); deba@165: it != _node_maps.end(); ++it) { deba@165: _writer_bits::writeToken(*_os, it->first) << '\t'; deba@165: } deba@165: *_os << std::endl; deba@165: deba@165: std::vector nodes; deba@165: for (NodeIt n(_graph); n != INVALID; ++n) { deba@165: nodes.push_back(n); deba@165: } deba@165: deba@165: if (label == 0) { deba@165: IdMap id_map(_graph); deba@165: _writer_bits::MapLess > id_less(id_map); deba@165: std::sort(nodes.begin(), nodes.end(), id_less); deba@165: } else { deba@165: label->sort(nodes); deba@165: } deba@165: deba@165: for (int i = 0; i < static_cast(nodes.size()); ++i) { deba@165: Node n = nodes[i]; deba@165: if (label == 0) { deba@165: std::ostringstream os; deba@165: os << _graph.id(n); deba@165: _writer_bits::writeToken(*_os, os.str()); deba@165: *_os << '\t'; deba@165: _node_index.insert(std::make_pair(n, os.str())); deba@165: } deba@165: for (typename NodeMaps::iterator it = _node_maps.begin(); deba@165: it != _node_maps.end(); ++it) { deba@165: std::string value = it->second->get(n); deba@165: _writer_bits::writeToken(*_os, value); deba@165: if (it->first == "label") { deba@165: _node_index.insert(std::make_pair(n, value)); deba@165: } deba@165: *_os << '\t'; deba@165: } deba@165: *_os << std::endl; deba@165: } deba@165: } deba@165: deba@185: void createNodeIndex() { deba@185: _writer_bits::MapStorageBase* label = 0; deba@185: for (typename NodeMaps::iterator it = _node_maps.begin(); deba@185: it != _node_maps.end(); ++it) { deba@185: if (it->first == "label") { deba@185: label = it->second; deba@185: break; deba@185: } deba@185: } deba@185: deba@185: if (label == 0) { deba@185: for (NodeIt n(_graph); n != INVALID; ++n) { deba@185: std::ostringstream os; deba@185: os << _graph.id(n); deba@185: _node_index.insert(std::make_pair(n, os.str())); deba@185: } deba@185: } else { deba@185: for (NodeIt n(_graph); n != INVALID; ++n) { deba@185: std::string value = label->get(n); deba@185: _node_index.insert(std::make_pair(n, value)); deba@185: } deba@185: } deba@185: } deba@185: deba@165: void writeEdges() { deba@165: _writer_bits::MapStorageBase* label = 0; deba@165: for (typename EdgeMaps::iterator it = _edge_maps.begin(); deba@165: it != _edge_maps.end(); ++it) { deba@165: if (it->first == "label") { deba@165: label = it->second; deba@165: break; deba@165: } deba@165: } deba@165: deba@165: *_os << "@edges"; deba@165: if (!_edges_caption.empty()) { deba@165: _writer_bits::writeToken(*_os << ' ', _edges_caption); deba@165: } deba@165: *_os << std::endl; deba@165: deba@165: *_os << '\t' << '\t'; deba@165: if (label == 0) { deba@165: *_os << "label" << '\t'; deba@165: } deba@165: for (typename EdgeMaps::iterator it = _edge_maps.begin(); deba@165: it != _edge_maps.end(); ++it) { deba@165: _writer_bits::writeToken(*_os, it->first) << '\t'; deba@165: } deba@165: *_os << std::endl; deba@165: deba@165: std::vector edges; deba@165: for (EdgeIt n(_graph); n != INVALID; ++n) { deba@165: edges.push_back(n); deba@165: } deba@165: deba@165: if (label == 0) { deba@165: IdMap id_map(_graph); deba@165: _writer_bits::MapLess > id_less(id_map); deba@165: std::sort(edges.begin(), edges.end(), id_less); deba@165: } else { deba@165: label->sort(edges); deba@165: } deba@165: deba@165: for (int i = 0; i < static_cast(edges.size()); ++i) { deba@165: Edge e = edges[i]; deba@165: _writer_bits::writeToken(*_os, _node_index. deba@165: find(_graph.u(e))->second); deba@165: *_os << '\t'; deba@165: _writer_bits::writeToken(*_os, _node_index. deba@165: find(_graph.v(e))->second); deba@165: *_os << '\t'; deba@165: if (label == 0) { deba@165: std::ostringstream os; deba@165: os << _graph.id(e); deba@165: _writer_bits::writeToken(*_os, os.str()); deba@165: *_os << '\t'; deba@165: _edge_index.insert(std::make_pair(e, os.str())); deba@165: } deba@165: for (typename EdgeMaps::iterator it = _edge_maps.begin(); deba@165: it != _edge_maps.end(); ++it) { deba@165: std::string value = it->second->get(e); deba@165: _writer_bits::writeToken(*_os, value); deba@165: if (it->first == "label") { deba@165: _edge_index.insert(std::make_pair(e, value)); deba@165: } deba@165: *_os << '\t'; deba@165: } deba@165: *_os << std::endl; deba@165: } deba@165: } deba@165: deba@185: void createEdgeIndex() { deba@185: _writer_bits::MapStorageBase* label = 0; deba@185: for (typename EdgeMaps::iterator it = _edge_maps.begin(); deba@185: it != _edge_maps.end(); ++it) { deba@185: if (it->first == "label") { deba@185: label = it->second; deba@185: break; deba@185: } deba@185: } deba@185: deba@185: if (label == 0) { deba@185: for (EdgeIt e(_graph); e != INVALID; ++e) { deba@185: std::ostringstream os; deba@185: os << _graph.id(e); deba@185: _edge_index.insert(std::make_pair(e, os.str())); deba@185: } deba@185: } else { deba@185: for (EdgeIt e(_graph); e != INVALID; ++e) { deba@185: std::string value = label->get(e); deba@185: _edge_index.insert(std::make_pair(e, value)); deba@185: } deba@185: } deba@185: } deba@185: deba@165: void writeAttributes() { deba@165: if (_attributes.empty()) return; deba@165: *_os << "@attributes"; deba@165: if (!_attributes_caption.empty()) { deba@165: _writer_bits::writeToken(*_os << ' ', _attributes_caption); deba@165: } deba@165: *_os << std::endl; deba@165: for (typename Attributes::iterator it = _attributes.begin(); deba@165: it != _attributes.end(); ++it) { deba@165: _writer_bits::writeToken(*_os, it->first) << ' '; deba@165: _writer_bits::writeToken(*_os, it->second->get()); deba@165: *_os << std::endl; deba@165: } deba@165: } deba@165: deba@165: public: deba@165: deba@165: /// \name Execution of the writer deba@165: /// @{ deba@165: deba@165: /// \brief Start the batch processing deba@165: /// kpeter@192: /// This function starts the batch processing. deba@165: void run() { deba@165: if (!_skip_nodes) { deba@165: writeNodes(); deba@185: } else { deba@185: createNodeIndex(); deba@165: } deba@165: if (!_skip_edges) { deba@165: writeEdges(); deba@185: } else { deba@185: createEdgeIndex(); deba@165: } deba@165: writeAttributes(); deba@165: } deba@165: kpeter@192: /// \brief Give back the stream of the writer deba@165: /// kpeter@192: /// Give back the stream of the writer deba@165: std::ostream& ostream() { deba@165: return *_os; deba@165: } deba@165: deba@165: /// @} deba@165: }; deba@165: kpeter@192: /// \brief Return a \ref GraphWriter class kpeter@192: /// kpeter@192: /// This function just returns a \ref GraphWriter class. deba@165: /// \relates GraphWriter deba@165: template deba@190: GraphWriter graphWriter(std::ostream& os, const Graph& graph) { deba@165: GraphWriter tmp(os, graph); deba@165: return tmp; deba@165: } deba@165: kpeter@192: /// \brief Return a \ref GraphWriter class kpeter@192: /// kpeter@192: /// This function just returns a \ref GraphWriter class. deba@165: /// \relates GraphWriter deba@165: template deba@190: GraphWriter graphWriter(const std::string& fn, const Graph& graph) { deba@165: GraphWriter tmp(fn, graph); deba@165: return tmp; deba@165: } deba@165: kpeter@192: /// \brief Return a \ref GraphWriter class kpeter@192: /// kpeter@192: /// This function just returns a \ref GraphWriter class. deba@165: /// \relates GraphWriter deba@165: template deba@190: GraphWriter graphWriter(const char* fn, const Graph& graph) { deba@165: GraphWriter tmp(fn, graph); deba@165: return tmp; deba@165: } deba@127: } deba@127: deba@127: #endif