/* -*- C++ -*-

 *

 * This file is a part of LEMON, a generic C++ optimization library

 *

 * Copyright (C) 2003-2008

 * 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 lemon_io

///\file

///\brief Lemon Format writer.

#ifndef LEMON_LEMON_WRITER_H

#define LEMON_LEMON_WRITER_H

#include <iostream>

#include <fstream>

#include <string>

#include <vector>

#include <algorithm>

#include <map>

#include <memory>

#include <lemon/error.h>

#include <lemon/bits/invalid.h>

#include <lemon/graph_utils.h>

#include <lemon/bits/item_writer.h>

#include <lemon/bits/utility.h>

#include <lemon/maps.h>

#include <lemon/dim2.h>

#include <lemon/concept_check.h>

#include <lemon/concepts/maps.h>

namespace lemon {

  namespace _writer_bits {

    template <typename T>

    bool operator<(T, T) {

      throw DataFormatError("Label is not comparable");

    }

    template <typename T>

    struct Less {

      bool operator()(const T& p, const T& q) const {

	return p < q;

      }

    };

    template <typename Map>

    struct ComposeLess {

      ComposeLess(const Map& _map) : map(_map), less() {}

      bool operator()(const typename Map::Key& p, 

                      const typename Map::Key& q) const {

	return less(map[p], map[q]);

      }

      const Map& map;

      Less<typename Map::Value> less;

    };

    template <typename UGraph, typename Map>

    struct UEdgeComposeLess {

      UEdgeComposeLess(const UGraph& _ugraph, const Map& _map) 

	: ugraph(_ugraph), map(_map), less() {}

      bool operator()(const typename UGraph::Edge& p, 

                      const typename UGraph::Edge& q) const {

	return p != q ? less(map[p], map[q]) : 

	  (!ugraph.direction(p) && ugraph.direction(q));

      }

      const UGraph& ugraph;

      const Map& map;

      Less<typename Map::Value> less;

    };

    template <typename Item>

    class ItemLabelWriter {

    public:

      bool isLabelWriter() { return true; }

      void writeLabel(std::ostream&, const Item&) {}

      template <class _ItemLabelWriter>

      struct Constraints {

	void constraints() {

	  bool b = writer.isLabelWriter();

	  ignore_unused_variable_warning(b);

	  writer.writeLabel(os, item);

	}

	_ItemLabelWriter& writer;

	std::ostream& os;

	const Item& item;

      };

    };

    template <typename Item>

    class ItemWriter {

    public:

      void write(std::ostream&, const Item&) {}

      template <class _ItemWriter>

      struct Constraints {

	void constraints() {

	  writer.write(os, item);

	}

	_ItemWriter& writer;

	std::ostream& os;

	const Item& item;

      };

    };

    template <typename Map>

    struct Ref { typedef const Map& Type; };

    template <typename Graph, typename Map>

    class ForwardComposeMap {

    public:

      typedef typename Graph::UEdge Key;

      typedef typename Map::Value Value;

      ForwardComposeMap(const Graph& _graph, const Map& _map) 

	: graph(_graph), map(_map) {}

      Value operator[](const Key& key) const {

	return map[graph.direct(key, true)];

      }

    private:

      const Graph& graph;

      typename Ref<Map>::Type map;

    };

    template <typename Graph, typename Map>

    ForwardComposeMap<Graph, Map>

    forwardComposeMap(const Graph& graph, const Map& map) {

      return ForwardComposeMap<Graph, Map>(graph, map);

    }

    template <typename Graph, typename Map>

    class BackwardComposeMap {

    public:

      typedef typename Graph::UEdge Key;

      typedef typename Map::Value Value;

      BackwardComposeMap(const Graph& _graph, const Map& _map) 

	: graph(_graph), map(_map) {}

      Value operator[](const Key& key) const {

	return map[graph.direct(key, false)];

      }

    private:

      const Graph& graph;

      typename Ref<Map>::Type map;

    };

    template <typename Graph, typename Map>

    BackwardComposeMap<Graph, Map>

    backwardComposeMap(const Graph& graph, const Map& map) {

      return BackwardComposeMap<Graph, Map>(graph, map);

    }

    template <typename Graph, typename Map>

    struct Ref<ForwardComposeMap<Graph, Map> > { 

      typedef ForwardComposeMap<Graph, Map> Type;

    };

    template <typename Graph, typename Map>

    struct Ref<BackwardComposeMap<Graph, Map> > { 

      typedef BackwardComposeMap<Graph, Map> Type; 

    };

    template <typename Map>

    struct Ref<dim2::XMap<Map> > { 

      typedef dim2::XMap<Map> Type;

    };

    template <typename Map>

    struct Ref<dim2::ConstXMap<Map> > { 

      typedef dim2::ConstXMap<Map> Type;

    };

    template <typename Map>

    struct Ref<dim2::YMap<Map> > { 

      typedef dim2::YMap<Map> Type;

    };

    template <typename Map>

    struct Ref<dim2::ConstYMap<Map> > { 

      typedef dim2::ConstYMap<Map> Type;

    };

    template <typename _Item>    

    class MapWriterBase {

    public:

      typedef _Item Item;

      virtual ~MapWriterBase() {}

      virtual void write(std::ostream& os, const Item& item) const = 0;

      virtual void sort(std::vector<Item>&) const = 0;

    };

    template <typename _Item, typename _Map, typename _Writer>

    class MapWriter : public MapWriterBase<_Item> {

    public:

      typedef _Map Map;

      typedef _Writer Writer;

      typedef typename Writer::Value Value;

      typedef _Item Item;

      typename _writer_bits::Ref<Map>::Type map;

      Writer writer;

      MapWriter(const Map& _map, const Writer& _writer) 

	: map(_map), writer(_writer) {}

      virtual ~MapWriter() {}

      virtual void write(std::ostream& os, const Item& item) const {

	Value value = map[item];

	writer.write(os, value);

      }

      virtual void sort(std::vector<Item>& items) const {

        ComposeLess<Map> less(map);

        std::sort(items.begin(), items.end(), less);

      }

    };

    template <typename _UGraph>    

    class UEdgeMapWriterBase {

    public:

      typedef typename _UGraph::Edge Edge;

      typedef typename _UGraph::UEdge UEdge;

      typedef UEdge Item;

      virtual ~UEdgeMapWriterBase() {}

      virtual void write(std::ostream& os, const Item& item) const = 0;

      virtual void sort(const _UGraph&, std::vector<Edge>&) const = 0;

      virtual void sort(std::vector<UEdge>&) const = 0;

    };

    template <typename _UGraph, typename _Map, typename _Writer>

    class UEdgeMapWriter : public UEdgeMapWriterBase<_UGraph> {

    public:

      typedef _Map Map;

      typedef _Writer Writer;

      typedef typename Writer::Value Value;

      typedef typename _UGraph::Edge Edge;

      typedef typename _UGraph::UEdge UEdge;

      typedef UEdge Item;

      typename _writer_bits::Ref<Map>::Type map;

      Writer writer;

      UEdgeMapWriter(const Map& _map, const Writer& _writer) 

	: map(_map), writer(_writer) {}

      virtual ~UEdgeMapWriter() {}

      virtual void write(std::ostream& os, const Item& item) const {

	Value value = map[item];

	writer.write(os, value);

      }

      virtual void sort(const _UGraph& ugraph, std::vector<Edge>& items) const {

        UEdgeComposeLess<_UGraph, Map> less(ugraph, map);

        std::sort(items.begin(), items.end(), less);

      }

      virtual void sort(std::vector<UEdge>& items) const {

        ComposeLess<Map> less(map);

        std::sort(items.begin(), items.end(), less);

      }

    };

    class ValueWriterBase {

    public:

      virtual ~ValueWriterBase() {}

      virtual void write(std::ostream&) = 0;

    };

    template <typename _Value, typename _Writer>

    class ValueWriter : public ValueWriterBase {

    public:

      typedef _Value Value;

      typedef _Writer Writer;

      ValueWriter(const Value& _value, const Writer& _writer)

 	: value(_value), writer(_writer) {}

      virtual void write(std::ostream& os) {

	writer.write(os, value);

      }

    private:

      const Value& value;

      Writer writer;

    };

    template <typename _Item>

    class LabelWriterBase {

    public:

      typedef _Item Item;

      virtual ~LabelWriterBase() {}

      virtual void write(std::ostream&, const Item&) const = 0;

      virtual void sort(std::vector<Item>&) const = 0;

      virtual bool isLabelWriter() const = 0;

      virtual LabelWriterBase* clone() const = 0;

    };

    template <typename _Item, typename _BoxedLabelWriter>

    class LabelWriter : public LabelWriterBase<_Item> {

    public:

      typedef _Item Item;

      typedef _BoxedLabelWriter BoxedLabelWriter;

      const BoxedLabelWriter& labelWriter;

      LabelWriter(const BoxedLabelWriter& _labelWriter) 

	: labelWriter(_labelWriter) {}

      virtual void write(std::ostream& os, const Item& item) const {

	labelWriter.writeLabel(os, item);

      }

      virtual void sort(std::vector<Item>& items) const {

	labelWriter.sortByLabel(items);

      }

      virtual bool isLabelWriter() const {

	return labelWriter.isLabelWriter();

      }

      virtual LabelWriter* clone() const {

	return new LabelWriter(labelWriter);

      }

    };

  }

  /// \ingroup lemon_io

  /// \brief Lemon Format writer class.

  /// 

  /// The Lemon Format contains several sections. We do not want to

  /// determine what sections are in a lemon file we give only a framework

  /// to write a section oriented format.

  ///

  /// In the Lemon Format each section starts with a line contains a \c \@

  /// character on the first not white space position. This line is the

  /// header line of the section. Each next lines belong to this section

  /// while it does not starts with \c \@ character. This line can start a 

  /// new section or if it can close the file with the \c \@end line.

  /// The file format ignore the empty lines and it may contain comments

  /// started with a \c # character to the end of the line. 

  ///

  /// The framework provides an abstract LemonWriter::SectionWriter class

  /// what defines the interface of a SectionWriter. The SectionWriter

  /// has the \c header() member function what gives back the header of the

  /// section. After that it will be called the \c write() member which

  /// should write the content of the section.

  ///

  /// \relates GraphWriter

  /// \relates NodeSetWriter

  /// \relates EdgeSetWriter

  /// \relates NodesWriter

  /// \relates EdgesWriter

  /// \relates AttributeWriter

  class LemonWriter {

  public:

    /// \brief Abstract base class for writing a section.

    ///

    /// This class has an \c header() member function what gives back

    /// the header line of the section. The \c write() member should

    /// write the content of the section to the stream.

    class SectionWriter {

      friend class LemonWriter;

    protected:

      /// \brief Constructor for SectionWriter.

      ///

      /// Constructor for SectionWriter. It attach this writer to

      /// the given LemonWriter.

      SectionWriter(LemonWriter& writer) {

	writer.attach(*this);

      }

      virtual ~SectionWriter() {}

      /// \brief The header of section.

      ///

      /// It gives back the header of the section.

      virtual std::string header() = 0;

      /// \brief Writer function of the section.

      ///

      /// Write the content of the section.

      virtual void write(std::ostream& os) = 0;

      /// \brief Gives back true when the section should be written.

      ///

      /// Gives back true when the section should be written.

      virtual bool valid() { return true; }

    };

    /// \brief Constructor for LemonWriter.

    ///

    /// Constructor for LemonWriter which writes to the given stream.

    LemonWriter(std::ostream& _os) 

      : os(&_os), own_os(false) {}

    /// \brief Constructor for LemonWriter.

    ///

    /// Constructor for LemonWriter which writes to the given file.

    LemonWriter(const std::string& filename) 

      : os(0), own_os(true) {

      os = new std::ofstream(filename.c_str());

    }

    /// \brief Desctructor for LemonWriter.

    ///

    /// Desctructor for LemonWriter.

    ~LemonWriter() {

      if (own_os) {

	delete os;

      }

    }

  private:

    LemonWriter(const LemonWriter&);

    void operator=(const LemonWriter&);

    void attach(SectionWriter& writer) {

      writers.push_back(&writer);

    }

  public:

    /// \brief Executes the LemonWriter.

    /// 

    /// It executes the LemonWriter.

    void run() {

      SectionWriters::iterator it;

      for (it = writers.begin(); it != writers.end(); ++it) {

        if ((*it)->valid()) {

          *os << (*it)->header() << std::endl;

          (*it)->write(*os);

        }

      }

      *os << "@end" << std::endl;

    }

  private:

    std::ostream* os;

    bool own_os;

    typedef std::vector<SectionWriter*> SectionWriters;

    SectionWriters writers;

  };

  /// \ingroup section_io

  /// \brief SectionWriter for writing a graph's nodeset.

  ///

  /// The lemon format can store multiple graph nodesets with several maps.

  /// The nodeset section's header line is \c \@nodeset \c nodeset_name, but 

  /// the \c nodeset_name may be empty.

  ///

  /// The first line of the section contains the names of the maps separated

  /// with white spaces. Each next lines describes a node in the nodeset, and

  /// contains the mapped values for each map.

  ///

  /// If the nodeset contains an \c "label" named map then it will be regarded

  /// as label map. This map should contain only unique values and when the 

  /// \c writeLabel() member will be called with a node it will write it's 

  /// label. Otherwise if the \c _forceLabelMap constructor parameter is true 

  /// then the label map will be the id in the graph. In addition if the

  /// the \c _forceSort is true then the writer will write the nodes

  /// sorted by the labels.

  ///

  /// \relates LemonWriter

  template <typename _Graph, typename _Traits = DefaultWriterTraits>

  class NodeSetWriter : public LemonWriter::SectionWriter {

    typedef LemonWriter::SectionWriter Parent;

  public:

    typedef _Graph Graph;

    typedef _Traits Traits;

    typedef typename Graph::Node Node;

    /// \brief Constructor.

    ///

    /// Constructor for NodeSetWriter. It creates the NodeSetWriter and

    /// attach it into the given LemonWriter. If the \c _forceLabelMap

    /// parameter is true then the writer will write own label map when

    /// the user does not give "label" named map. In addition if the

    /// the \c _forceSort is true then the writer will write the edges

    /// sorted by the labels.

    NodeSetWriter(LemonWriter& _writer, const Graph& _graph, 

		  const std::string& _name = std::string(), 

		  bool _forceLabelMap = true, bool _forceSort = true) 

      : Parent(_writer), labelMap(0), forceLabelMap(_forceLabelMap), 

	forceSort(_forceSort), graph(_graph), name(_name) {}

    /// \brief Destructor.

    ///

    /// Destructor for NodeSetWriter.

    virtual ~NodeSetWriter() {

      typename MapWriters::iterator it;

      for (it = writers.begin(); it != writers.end(); ++it) {

	delete it->second;

      }

    }

  private:

    NodeSetWriter(const NodeSetWriter&);

    void operator=(const NodeSetWriter&);

  public:

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

    ///

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

    template <typename Map>

    NodeSetWriter& writeNodeMap(std::string label, const Map& map) {

      return writeNodeMap<typename Traits::

	template Writer<typename Map::Value>, Map>(label, map);

    }

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

    ///

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

    template <typename ItemWriter, typename Map>

    NodeSetWriter& writeNodeMap(std::string label, const Map& map, 

			    const ItemWriter& iw = ItemWriter()) {

      checkConcept<concepts::ReadMap<Node, typename Map::Value>, Map>();

      checkConcept<_writer_bits::ItemWriter<typename Map::Value>,ItemWriter>();

      writers.push_back(

	make_pair(label, new _writer_bits::

		  MapWriter<Node, Map, ItemWriter>(map, iw)));

      return *this;

    }

  protected:

    /// \brief The header of the section.

    ///

    /// It gives back the header of the section.

    virtual std::string header() {

      return "@nodeset " + name;

    }

    /// \brief  Writer function of the section.

    ///

    /// Write the content of the section.

    virtual void write(std::ostream& os) {

      for (int i = 0; i < int(writers.size()); ++i) {

	if (writers[i].first == "label") {

	  labelMap = writers[i].second;

	  forceLabelMap = false;

	  break;

	}

      }

      std::vector<Node> items;

      for (typename Graph::NodeIt it(graph); it != INVALID; ++it) {

        items.push_back(it);

      }

      if (forceSort) {

        if (labelMap) {

          labelMap->sort(items);

        } else {

          typedef IdMap<Graph, Node> Map;

          Map map(graph);

          _writer_bits::ComposeLess<Map> less(map);

          std::sort(items.begin(), items.end(), less);

        }

      }

      if (forceLabelMap) {

	os << "label\t";

      }

      for (int i = 0; i < int(writers.size()); ++i) {

	os << writers[i].first << '\t';

      }

      os << std::endl;

      for (typename std::vector<Node>::iterator it = items.begin();

           it != items.end(); ++it) {

	if (forceLabelMap) {

	  os << graph.id(*it) << '\t';

	}

	for (int i = 0; i < int(writers.size()); ++i) {

	  writers[i].second->write(os, *it);

	  os << '\t';

	}

	os << std::endl;

      }

    }

  public:

    /// \brief Returns true if the nodeset can write the labels of the nodes.

    ///

    /// Returns true if the nodeset can write the labels of the nodes.

    /// It is possible only if a "label" named map was written or the 

    /// \c _forceLabelMap constructor parameter was true.

    bool isLabelWriter() const {

      return labelMap != 0 || forceLabelMap;

    }

    /// \brief Write the label of the given node.

    ///

    /// It writes the label of the given node. If there was written a "label"

    /// named map then it will write the map value belongs to the node.

    /// Otherwise if the \c forceLabel parameter was true it will write

    /// its label in the graph. 

    void writeLabel(std::ostream& os, const Node& item) const {

      if (forceLabelMap) {

	os << graph.id(item);

      } else {

	labelMap->write(os, item);

      }

    }

    /// \brief Sorts the given node vector by label.

    ///

    /// Sorts the given node vector by label. If there was written an

    /// "label" named map then the vector will be sorted by the values

    /// of this map. Otherwise if the \c forceLabel parameter was true

    /// it will be sorted by its id in the graph.

    void sortByLabel(std::vector<Node>& nodes) const {

      if (labelMap) {

	labelMap->sort(nodes);

      } else {

	typedef IdMap<Graph, Node> Map;

	Map map(graph);

	_writer_bits::ComposeLess<Map> less(map);

	std::sort(nodes.begin(), nodes.end(), less);

      }

    }

  private:

    typedef std::vector<std::pair<std::string, _writer_bits::

				  MapWriterBase<Node>*> > MapWriters;

    MapWriters writers;

    _writer_bits::MapWriterBase<Node>* labelMap;

    bool forceLabelMap;

    bool forceSort;

    const Graph& graph;   

    std::string name;

  };

  /// \ingroup section_io

  /// \brief SectionWriter for writing a bipartite graph's nodeset.

  ///

  /// The lemon format can store multiple bipartite graph nodesets

  /// with several maps.  The nodeset section's header line is \c

  /// \@bpnodeset \c bpnodeset_name, but the \c bpnodeset_name may be empty.

  ///

  /// The first line of the section contains the names of the maps separated

  /// with white spaces. Each next lines describes a node in the nodeset, and

  /// contains the mapped values for each map.

  ///

  /// If the nodeset contains an \c "label" named map then it will be regarded

  /// as label map. This map should contain only unique values and when the 

  /// \c writeLabel() member will be called with a node it will write it's 

  /// label. Otherwise if the \c _forceLabelMap constructor parameter is true 

  /// then the label map will be the id in the graph. In addition if the

  /// the \c _forceSort is true then the writer will write the edges

  /// sorted by the labels.

  ///

  /// \relates LemonWriter

  template <typename _Graph, typename _Traits = DefaultWriterTraits>

  class BpNodeSetWriter : public LemonWriter::SectionWriter {

    typedef LemonWriter::SectionWriter Parent;

  public:

    typedef _Graph Graph;

    typedef _Traits Traits;

    typedef typename Graph::Node Node;

    /// \brief Constructor.

    ///

    /// Constructor for BpNodeSetWriter. It creates the BpNodeSetWriter and

    /// attach it into the given LemonWriter. If the \c _forceLabelMap

    /// parameter is true then the writer will write own label map when

    /// the user does not give "label" named map. In addition if the

    /// the \c _forceSort is true then the writer will write the nodes

    /// sorted by the labels.

    BpNodeSetWriter(LemonWriter& _writer, const Graph& _graph, 

		  const std::string& _name = std::string(), 

		  bool _forceLabelMap = true, bool _forceSort = true) 

      : Parent(_writer), labelMap(0), forceLabelMap(_forceLabelMap), 

	forceSort(_forceSort), graph(_graph), name(_name) {}

    /// \brief Destructor.

    ///

    /// Destructor for BpNodeSetWriter.

    virtual ~BpNodeSetWriter() {

      typename MapWriters::iterator it;

      for (it = writers.begin(); it != writers.end(); ++it) {

	delete it->second;

      }

    }

  private:

    BpNodeSetWriter(const BpNodeSetWriter&);

    void operator=(const BpNodeSetWriter&);

  public:

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

    ///

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

    template <typename Map>

    BpNodeSetWriter& writeANodeMap(std::string label, const Map& map) {

      return writeANodeMap<typename Traits::

	template Writer<typename Map::Value>, Map>(label, map);

    }

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

    ///

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

    template <typename ItemWriter, typename Map>

    BpNodeSetWriter& writeANodeMap(std::string label, const Map& map, 

				   const ItemWriter& iw = ItemWriter()) {

      checkConcept<concepts::ReadMap<Node, typename Map::Value>, Map>();

      checkConcept<_writer_bits::ItemWriter<typename Map::Value>,ItemWriter>();

      if (label == "label") {

	throw IoParameterError("Label cannot be A-node map");

      }

      awriters.push_back(make_pair(label, new _writer_bits::

				   MapWriter<Node, Map, ItemWriter>(map, iw)));

      return *this;

    }

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

    ///

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

    template <typename Map>

    BpNodeSetWriter& writeBNodeMap(std::string label, const Map& map) {

      return writeBNodeMap<typename Traits::

	template Writer<typename Map::Value>, Map>(label, map);

    }

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

    ///

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

    template <typename ItemWriter, typename Map>

    BpNodeSetWriter& writeBNodeMap(std::string label, const Map& map, 

				   const ItemWriter& iw = ItemWriter()) {

      checkConcept<concepts::ReadMap<Node, typename Map::Value>, Map>();

      checkConcept<_writer_bits::ItemWriter<typename Map::Value>,ItemWriter>();

      if (label == "label") {

	throw IoParameterError("Label cannot be B-node map");

      }

      bwriters.push_back(make_pair(label, new _writer_bits::

				   MapWriter<Node, Map, ItemWriter>(map, iw)));

      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 Map>

    BpNodeSetWriter& writeNodeMap(std::string label, const Map& map) {

      return writeNodeMap<typename Traits::

	template Writer<typename Map::Value>, Map>(label, map);

    }

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

    ///

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

    template <typename ItemWriter, typename Map>

    BpNodeSetWriter& writeNodeMap(std::string label, const Map& map, 

				  const ItemWriter& iw = ItemWriter()) {

      checkConcept<concepts::ReadMap<Node, typename Map::Value>, Map>();

      checkConcept<_writer_bits::ItemWriter<typename Map::Value>,ItemWriter>();

      writers.push_back(make_pair(label, new _writer_bits::

				  MapWriter<Node, Map, ItemWriter>(map, iw)));

      return *this;

    }

  protected:

    /// \brief The header of the section.

    ///

    /// It gives back the header of the section.

    virtual std::string header() {

      return "@bpnodeset " + name;

    }

    /// \brief Writer function of the section.

    ///

    /// Write the content of the section.

    virtual void write(std::ostream& os) {

      for (int i = 0; i < int(writers.size()); ++i) {

	if (writers[i].first == "label") {

	  labelMap = writers[i].second;

	  forceLabelMap = false;

	  break;

	}

      }

      {

	os << "&anodeset ";

	std::vector<Node> items;

	for (typename Graph::ANodeIt it(graph); it != INVALID; ++it) {

	  items.push_back(it);

	}

	if (forceSort) {

	  if (labelMap) {

	    labelMap->sort(items);

	  } else {

	    typedef IdMap<Graph, Node> Map;

	    Map map(graph);

	    _writer_bits::ComposeLess<Map> less(map);

	    std::sort(items.begin(), items.end(), less);

	  }

	}

	if (forceLabelMap) {

	  os << "label\t";

	}

	for (int i = 0; i < int(writers.size()); ++i) {

	  os << writers[i].first << '\t';

	}

	for (int i = 0; i < int(awriters.size()); ++i) {

	  os << awriters[i].first << '\t';

	}

	os << std::endl;

	for (typename std::vector<Node>::iterator it = items.begin();

	     it != items.end(); ++it) {

	  if (forceLabelMap) {

	    os << graph.id(*it) << '\t';

	  }

	  for (int i = 0; i < int(writers.size()); ++i) {

	    writers[i].second->write(os, *it);

	    os << '\t';

	  }

	  for (int i = 0; i < int(awriters.size()); ++i) {

	    awriters[i].second->write(os, *it);

	    os << '\t';

	  }

	  os << std::endl;

	}

      }

      {

	os << "&bnodeset ";

	std::vector<Node> items;

	for (typename Graph::BNodeIt it(graph); it != INVALID; ++it) {

	  items.push_back(it);

	}

	if (forceSort) {

	  if (labelMap) {

	    labelMap->sort(items);

	  } else {

	    typedef IdMap<Graph, Node> Map;

	    Map map(graph);

	    _writer_bits::ComposeLess<Map> less(map);

	    std::sort(items.begin(), items.end(), less);

	  }

	}

	if (forceLabelMap) {

	  os << "label\t";

	}

	for (int i = 0; i < int(writers.size()); ++i) {

	  os << writers[i].first << '\t';

	}

	for (int i = 0; i < int(bwriters.size()); ++i) {

	  os << bwriters[i].first << '\t';

	}

	os << std::endl;

	for (typename std::vector<Node>::iterator it = items.begin();

	     it != items.end(); ++it) {

	  if (forceLabelMap) {

	    os << graph.id(*it) << '\t';

	  }

	  for (int i = 0; i < int(writers.size()); ++i) {

	    writers[i].second->write(os, *it);

	    os << '\t';

	  }

	  for (int i = 0; i < int(bwriters.size()); ++i) {

	    bwriters[i].second->write(os, *it);

	    os << '\t';

	  }

	  os << std::endl;

	}

      }

    }

  public:

    /// \brief Returns true if the nodeset can write the labels of the nodes.

    ///

    /// Returns true if the nodeset can write the labels of the nodes.

    /// It is possible only if a "label" named map was written or the 

    /// \c _forceLabelMap constructor parameter was true.

    bool isLabelWriter() const {

      return labelMap != 0 || forceLabelMap;

    }

    /// \brief Write the label of the given node.

    ///

    /// It writes the label of the given node. If there was written a "label"

    /// named map then it will write the map value belongs to the node.

    /// Otherwise if the \c forceLabel parameter was true it will write

    /// its label in the graph. 

    void writeLabel(std::ostream& os, const Node& item) const {

      if (forceLabelMap) {

	os << graph.id(item);

      } else {

	labelMap->write(os, item);

      }

    }

    /// \brief Sorts the given node vector by label.

    ///

    /// Sorts the given node vector by label. If there was written an

    /// "label" named map then the vector will be sorted by the values

    /// of this map. Otherwise if the \c forceLabel parameter was true

    /// it will be sorted by its id in the graph.

    void sortByLabel(std::vector<Node>& nodes) const {

      if (labelMap) {

	labelMap->sort(nodes);

      } else {

	typedef IdMap<Graph, Node> Map;

	Map map(graph);

	_writer_bits::ComposeLess<Map> less(map);

	std::sort(nodes.begin(), nodes.end(), less);

      }

    }

  private:

    typedef std::vector<std::pair<std::string, _writer_bits::

				  MapWriterBase<Node>*> > MapWriters;

    MapWriters awriters, bwriters, writers;

    _writer_bits::MapWriterBase<Node>* labelMap;

    bool forceLabelMap;

    bool forceSort;

    const Graph& graph;   

    std::string name;

  };

  /// \ingroup section_io

  /// \brief SectionWriter for writing a graph's edgesets.

  ///

  /// The lemon format can store multiple graph edgesets with several maps. 

  /// The edgeset section's header line is \c \@edgeset \c edgeset_name, but 

  /// the \c edgeset_name may be empty.

  ///

  /// The first line of the section contains the names of the maps separated

  /// with white spaces. Each next lines describes a edge in the edgeset. The

  /// line contains the source and the target nodes' label and the mapped 

  /// values for each map.

  ///

  /// If the edgeset contains an \c "label" named map then it will be regarded

  /// as label map. This map should contain only unique values and when the 

  /// \c writeLabel() member will be called with an edge it will write it's 

  /// label. Otherwise if the \c _forceLabelMap constructor parameter is true 

  /// then the label map will be the id in the graph. In addition if the