Changes in / [455:5a1e9fdcfd3a:445:75a5df083951] in lemon-main

Files:

• doc/groups.dox (modified) (5 diffs)
• lemon/adaptors.h (modified) (69 diffs)
• lemon/bits/graph_adaptor_extender.h (modified) (1 diff)

doc/groups.dox

@@ -63 +63 @@
 
 /**
-@defgroup graph_adaptors Adaptor Classes for Graphs
+@defgroup graph_adaptors Adaptor Classes for graphs
 @ingroup graphs
-\brief Adaptor classes for digraphs and graphs
-
-This group contains several useful adaptor classes for digraphs and graphs.
+\brief This group contains several adaptor classes for digraphs and graphs
 
 The main parts of LEMON are the different graph structures, generic
-graph algorithms, graph concepts, which couple them, and graph
+graph algorithms, graph concepts which couple these, and graph
 adaptors. While the previous notions are more or less clear, the
 latter one needs further explanation. Graph adaptors are graph classes
@@ -76 +74 @@
 
 A short example makes this much clearer.  Suppose that we have an
-instance \c g of a directed graph type, say ListDigraph and an algorithm
+instance \c g of a directed graph type say ListDigraph and an algorithm
 \code
 template <typename Digraph>
@@ -84 +82 @@
 (in time or in memory usage) to copy \c g with the reversed
 arcs.  In this case, an adaptor class is used, which (according
-to LEMON \ref concepts::Digraph "digraph concepts") works as a digraph.
-The adaptor uses the original digraph structure and digraph operations when
-methods of the reversed oriented graph are called.  This means that the adaptor
-have minor memory usage, and do not perform sophisticated algorithmic
+to LEMON digraph concepts) works as a digraph.  The adaptor uses the
+original digraph structure and digraph operations when methods of the
+reversed oriented graph are called.  This means that the adaptor have
+minor memory usage, and do not perform sophisticated algorithmic
 actions.  The purpose of it is to give a tool for the cases when a
 graph have to be used in a specific alteration.  If this alteration is
-obtained by a usual construction like filtering the node or the arc set or
+obtained by a usual construction like filtering the arc-set or
 considering a new orientation, then an adaptor is worthwhile to use.
 To come back to the reverse oriented graph, in this situation
@@ -99 +97 @@
 \code
 ListDigraph g;
-ReverseDigraph<ListDigraph> rg(g);
+ReverseDigraph<ListGraph> rg(g);
 int result = algorithm(rg);
 \endcode
-During running the algorithm, the original digraph \c g is untouched.
-This techniques give rise to an elegant code, and based on stable
+After running the algorithm, the original graph \c g is untouched.
+This techniques gives rise to an elegant code, and based on stable
 graph adaptors, complex algorithms can be implemented easily.
 
-In flow, circulation and matching problems, the residual
+In flow, circulation and bipartite matching problems, the residual
 graph is of particular importance. Combining an adaptor implementing
-this with shortest path algorithms or minimum mean cycle algorithms,
+this, shortest path algorithms and minimum mean cycle algorithms,
 a range of weighted and cardinality optimization algorithms can be
 obtained. For other examples, the interested user is referred to the
@@ -115 +113 @@
 The behavior of graph adaptors can be very different. Some of them keep
 capabilities of the original graph while in other cases this would be
-meaningless. This means that the concepts that they meet depend
-on the graph adaptor, and the wrapped graph.
-For example, if an arc of a reversed digraph is deleted, this is carried
-out by deleting the corresponding arc of the original digraph, thus the
-adaptor modifies the original digraph.
-However in case of a residual digraph, this operation has no sense.
-
+meaningless. This means that the concepts that they are models of depend
+on the graph adaptor, and the wrapped graph(s).
+If an arc of \c rg is deleted, this is carried out by deleting the
+corresponding arc of \c g, thus the adaptor modifies the original graph.
+
+But for a residual graph, this operation has no sense.
 Let us stand one more example here to simplify your work.
-ReverseDigraph has constructor
+RevGraphAdaptor has constructor
 \code
 ReverseDigraph(Digraph& digraph);
 \endcode
-This means that in a situation, when a <tt>const %ListDigraph&</tt>
+This means that in a situation, when a <tt>const ListDigraph&</tt>
 reference to a graph is given, then it have to be instantiated with
-<tt>Digraph=const %ListDigraph</tt>.
+<tt>Digraph=const ListDigraph</tt>.
 \code
 int algorithm1(const ListDigraph& g) {
-  ReverseDigraph<const ListDigraph> rg(g);
+  RevGraphAdaptor<const ListDigraph> rg(g);
   return algorithm2(rg);
 }

lemon/adaptors.h

@@ -22 +22 @@
 /// \ingroup graph_adaptors
 /// \file
-/// \brief Adaptor classes for digraphs and graphs
+/// \brief Several graph adaptors
 ///
 /// This file contains several useful adaptors for digraphs and graphs.
@@ -71 +71 @@
     int nodeNum() const { return _digraph->nodeNum(); }
 
-    typedef ArcNumTagIndicator<Digraph> ArcNumTag;
+    typedef EdgeNumTagIndicator<Digraph> EdgeNumTag;
     int arcNum() const { return _digraph->arcNum(); }
 
-    typedef FindArcTagIndicator<Digraph> FindArcTag;
-    Arc findArc(const Node& u, const Node& v, const Arc& prev = INVALID) const {
+    typedef FindEdgeTagIndicator<Digraph> FindEdgeTag;
+    Arc findArc(const Node& u, const Node& v, const Arc& prev = INVALID) {
       return _digraph->findArc(u, v, prev);
     }
@@ -82 +82 @@
     Arc addArc(const Node& u, const Node& v) { return _digraph->addArc(u, v); }
 
-    void erase(const Node& n) { _digraph->erase(n); }
-    void erase(const Arc& a) { _digraph->erase(a); }
-
-    void clear() { _digraph->clear(); }
+    void erase(const Node& n) const { _digraph->erase(n); }
+    void erase(const Arc& a) const { _digraph->erase(a); }
+
+    void clear() const { _digraph->clear(); }
 
     int id(const Node& n) const { return _digraph->id(n); }
@@ -199 +199 @@
     int nodeNum() const { return _graph->nodeNum(); }
 
-    typedef ArcNumTagIndicator<Graph> ArcNumTag;
+    typedef EdgeNumTagIndicator<Graph> EdgeNumTag;
     int arcNum() const { return _graph->arcNum(); }
-
-    typedef EdgeNumTagIndicator<Graph> EdgeNumTag;
     int edgeNum() const { return _graph->edgeNum(); }
 
-    typedef FindArcTagIndicator<Graph> FindArcTag;
-    Arc findArc(const Node& u, const Node& v,
-                const Arc& prev = INVALID) const {
+    typedef FindEdgeTagIndicator<Graph> FindEdgeTag;
+    Arc findArc(const Node& u, const Node& v, const Arc& prev = INVALID) {
       return _graph->findArc(u, v, prev);
     }
-
-    typedef FindEdgeTagIndicator<Graph> FindEdgeTag;
-    Edge findEdge(const Node& u, const Node& v,
-                  const Edge& prev = INVALID) const {
+    Edge findEdge(const Node& u, const Node& v, const Edge& prev = INVALID) {
       return _graph->findEdge(u, v, prev);
     }
@@ -337 +331 @@
     Arc addArc(const Node& u, const Node& v) { return Parent::addArc(v, u); }
 
-    typedef FindArcTagIndicator<Digraph> FindArcTag;
+    typedef FindEdgeTagIndicator<Digraph> FindEdgeTag;
     Arc findArc(const Node& u, const Node& v,
-                const Arc& prev = INVALID) const {
+                const Arc& prev = INVALID) {
       return Parent::findArc(v, u, prev);
     }
@@ -347 +341 @@
   /// \ingroup graph_adaptors
   ///
-  /// \brief Adaptor class for reversing the orientation of the arcs in
-  /// a digraph.
-  ///
-  /// ReverseDigraph can be used for reversing the arcs in a digraph.
-  /// It conforms to the \ref concepts::Digraph "Digraph" concept.
-  ///
-  /// The adapted digraph can also be modified through this adaptor
-  /// by adding or removing nodes or arcs, unless the \c GR template
-  /// parameter is set to be \c const.
-  ///
-  /// \tparam GR The type of the adapted digraph.
-  /// It must conform to the \ref concepts::Digraph "Digraph" concept.
-  /// It can also be specified to be \c const.
-  ///
-  /// \note The \c Node and \c Arc types of this adaptor and the adapted
-  /// digraph are convertible to each other.
-  template<typename GR>
-#ifdef DOXYGEN
-  class ReverseDigraph {
-#else
+  /// \brief A digraph adaptor which reverses the orientation of the arcs.
+  ///
+  /// ReverseDigraph reverses the arcs in the adapted digraph. The
+  /// SubDigraph is conform to the \ref concepts::Digraph
+  /// "Digraph concept".
+  ///
+  /// \tparam _Digraph It must be conform to the \ref concepts::Digraph
+  /// "Digraph concept". The type can be specified to be const.
+  template<typename _Digraph>
   class ReverseDigraph :
-    public DigraphAdaptorExtender<ReverseDigraphBase<GR> > {
-#endif
-  public:
-    /// The type of the adapted digraph.
-    typedef GR Digraph;
-    typedef DigraphAdaptorExtender<ReverseDigraphBase<GR> > Parent;
+    public DigraphAdaptorExtender<ReverseDigraphBase<_Digraph> > {
+  public:
+    typedef _Digraph Digraph;
+    typedef DigraphAdaptorExtender<
+      ReverseDigraphBase<_Digraph> > Parent;
   protected:
     ReverseDigraph() { }
@@ -380 +362 @@
     /// \brief Constructor
     ///
-    /// Creates a reverse digraph adaptor for the given digraph.
+    /// Creates a reverse digraph adaptor for the given digraph
     explicit ReverseDigraph(Digraph& digraph) {
       Parent::setDigraph(digraph);
@@ -386 +368 @@
   };
 
-  /// \brief Returns a read-only ReverseDigraph adaptor
-  ///
-  /// This function just returns a read-only \ref ReverseDigraph adaptor.
-  /// \ingroup graph_adaptors
-  /// \relates ReverseDigraph
-  template<typename GR>
-  ReverseDigraph<const GR> reverseDigraph(const GR& digraph) {
-    return ReverseDigraph<const GR>(digraph);
+  /// \brief Just gives back a reverse digraph adaptor
+  ///
+  /// Just gives back a reverse digraph adaptor
+  template<typename Digraph>
+  ReverseDigraph<const Digraph> reverseDigraph(const Digraph& digraph) {
+    return ReverseDigraph<const Digraph>(digraph);
   }
-
 
   template <typename _Digraph, typename _NodeFilterMap,
@@ -479 +458 @@
     }
 
-    void status(const Node& n, bool v) const { _node_filter->set(n, v); }
-    void status(const Arc& a, bool v) const { _arc_filter->set(a, v); }
-
-    bool status(const Node& n) const { return (*_node_filter)[n]; }
-    bool status(const Arc& a) const { return (*_arc_filter)[a]; }
+    void hide(const Node& n) const { _node_filter->set(n, false); }
+    void hide(const Arc& a) const { _arc_filter->set(a, false); }
+
+    void unHide(const Node& n) const { _node_filter->set(n, true); }
+    void unHide(const Arc& a) const { _arc_filter->set(a, true); }
+
+    bool hidden(const Node& n) const { return !(*_node_filter)[n]; }
+    bool hidden(const Arc& a) const { return !(*_arc_filter)[a]; }
 
     typedef False NodeNumTag;
-    typedef False ArcNumTag;
-
-    typedef FindArcTagIndicator<Digraph> FindArcTag;
+    typedef False EdgeNumTag;
+
+    typedef FindEdgeTagIndicator<Digraph> FindEdgeTag;
     Arc findArc(const Node& source, const Node& target,
-                const Arc& prev = INVALID) const {
+                const Arc& prev = INVALID) {
       if (!(*_node_filter)[source] || !(*_node_filter)[target]) {
         return INVALID;
@@ -619 +601 @@
     }
 
-    void status(const Node& n, bool v) const { _node_filter->set(n, v); }
-    void status(const Arc& a, bool v) const { _arc_filter->set(a, v); }
-
-    bool status(const Node& n) const { return (*_node_filter)[n]; }
-    bool status(const Arc& a) const { return (*_arc_filter)[a]; }
+    void hide(const Node& n) const { _node_filter->set(n, false); }
+    void hide(const Arc& e) const { _arc_filter->set(e, false); }
+
+    void unHide(const Node& n) const { _node_filter->set(n, true); }
+    void unHide(const Arc& e) const { _arc_filter->set(e, true); }
+
+    bool hidden(const Node& n) const { return !(*_node_filter)[n]; }
+    bool hidden(const Arc& e) const { return !(*_arc_filter)[e]; }
 
     typedef False NodeNumTag;
-    typedef False ArcNumTag;
-
-    typedef FindArcTagIndicator<Digraph> FindArcTag;
+    typedef False EdgeNumTag;
+
+    typedef FindEdgeTagIndicator<Digraph> FindEdgeTag;
     Arc findArc(const Node& source, const Node& target,
-                const Arc& prev = INVALID) const {
+                const Arc& prev = INVALID) {
       if (!(*_node_filter)[source] || !(*_node_filter)[target]) {
         return INVALID;
@@ -695 +680 @@
   /// \ingroup graph_adaptors
   ///
-  /// \brief Adaptor class for hiding nodes and arcs in a digraph
-  ///
-  /// SubDigraph can be used for hiding nodes and arcs in a digraph.
-  /// A \c bool node map and a \c bool arc map must be specified, which
-  /// define the filters for nodes and arcs.
-  /// Only the nodes and arcs with \c true filter value are
-  /// shown in the subdigraph. The arcs that are incident to hidden
-  /// nodes are also filtered out.
-  /// This adaptor conforms to the \ref concepts::Digraph "Digraph" concept.
-  ///
-  /// The adapted digraph can also be modified through this adaptor
-  /// by adding or removing nodes or arcs, unless the \c GR template
-  /// parameter is set to be \c const.
-  ///
-  /// \tparam GR The type of the adapted digraph.
-  /// It must conform to the \ref concepts::Digraph "Digraph" concept.
-  /// It can also be specified to be \c const.
-  /// \tparam NF The type of the node filter map.
-  /// It must be a \c bool (or convertible) node map of the
-  /// adapted digraph. The default type is
-  /// \ref concepts::Digraph::NodeMap "GR::NodeMap<bool>".
-  /// \tparam AF The type of the arc filter map.
-  /// It must be \c bool (or convertible) arc map of the
-  /// adapted digraph. The default type is
-  /// \ref concepts::Digraph::ArcMap "GR::ArcMap<bool>".
-  ///
-  /// \note The \c Node and \c Arc types of this adaptor and the adapted
-  /// digraph are convertible to each other.
+  /// \brief An adaptor for hiding nodes and arcs in a digraph
+  ///
+  /// SubDigraph hides nodes and arcs in a digraph. A bool node map
+  /// and a bool arc map must be specified, which define the filters
+  /// for nodes and arcs. Just the nodes and arcs with true value are
+  /// shown in the subdigraph. The SubDigraph is conform to the \ref
+  /// concepts::Digraph "Digraph concept". If the \c _checked parameter
+  /// is true, then the arcs incident to filtered nodes are also
+  /// filtered out.
+  ///
+  /// \tparam _Digraph It must be conform to the \ref
+  /// concepts::Digraph "Digraph concept". The type can be specified
+  /// to const.
+  /// \tparam _NodeFilterMap A bool valued node map of the the adapted digraph.
+  /// \tparam _ArcFilterMap A bool valued arc map of the the adapted digraph.
+  /// \tparam _checked If the parameter is false then the arc filtering
+  /// is not checked with respect to node filter. Otherwise, each arc
+  /// is automatically filtered, which is incident to a filtered node.
   ///
   /// \see FilterNodes
   /// \see FilterArcs
-#ifdef DOXYGEN
-  template<typename GR, typename NF, typename AF>
-  class SubDigraph {
-#else
-  template<typename GR,
-           typename NF = typename GR::template NodeMap<bool>,
-           typename AF = typename GR::template ArcMap<bool> >
-  class SubDigraph :
-    public DigraphAdaptorExtender<SubDigraphBase<GR, NF, AF, true> > {
-#endif
-  public:
-    /// The type of the adapted digraph.
-    typedef GR Digraph;
-    /// The type of the node filter map.
-    typedef NF NodeFilterMap;
-    /// The type of the arc filter map.
-    typedef AF ArcFilterMap;
-
-    typedef DigraphAdaptorExtender<SubDigraphBase<GR, NF, AF, true> >
-      Parent;
+  template<typename _Digraph,
+           typename _NodeFilterMap = typename _Digraph::template NodeMap<bool>,
+           typename _ArcFilterMap = typename _Digraph::template ArcMap<bool>,
+           bool _checked = true>
+  class SubDigraph
+    : public DigraphAdaptorExtender<
+      SubDigraphBase<_Digraph, _NodeFilterMap, _ArcFilterMap, _checked> > {
+  public:
+    typedef _Digraph Digraph;
+    typedef _NodeFilterMap NodeFilterMap;
+    typedef _ArcFilterMap ArcFilterMap;
+
+    typedef DigraphAdaptorExtender<
+      SubDigraphBase<Digraph, NodeFilterMap, ArcFilterMap, _checked> >
+    Parent;
 
     typedef typename Parent::Node Node;
@@ -756 +726 @@
     /// \brief Constructor
     ///
-    /// Creates a subdigraph for the given digraph with the
-    /// given node and arc filter maps.
+    /// Creates a subdigraph for the given digraph with
+    /// given node and arc map filters.
     SubDigraph(Digraph& digraph, NodeFilterMap& node_filter,
                ArcFilterMap& arc_filter) {
@@ -765 +735 @@
     }
 
-    /// \brief Sets the status of the given node
-    ///
-    /// This function sets the status of the given node.
-    /// It is done by simply setting the assigned value of \c n
-    /// to \c v in the node filter map.
-    void status(const Node& n, bool v) const { Parent::status(n, v); }
-
-    /// \brief Sets the status of the given arc
-    ///
-    /// This function sets the status of the given arc.
-    /// It is done by simply setting the assigned value of \c a
-    /// to \c v in the arc filter map.
-    void status(const Arc& a, bool v) const { Parent::status(a, v); }
-
-    /// \brief Returns the status of the given node
-    ///
-    /// This function returns the status of the given node.
-    /// It is \c true if the given node is enabled (i.e. not hidden).
-    bool status(const Node& n) const { return Parent::status(n); }
-
-    /// \brief Returns the status of the given arc
-    ///
-    /// This function returns the status of the given arc.
-    /// It is \c true if the given arc is enabled (i.e. not hidden).
-    bool status(const Arc& a) const { return Parent::status(a); }
-
-    /// \brief Disables the given node
-    ///
-    /// This function disables the given node in the subdigraph,
-    /// so the iteration jumps over it.
-    /// It is the same as \ref status() "status(n, false)".
-    void disable(const Node& n) const { Parent::status(n, false); }
-
-    /// \brief Disables the given arc
-    ///
-    /// This function disables the given arc in the subdigraph,
-    /// so the iteration jumps over it.
-    /// It is the same as \ref status() "status(a, false)".
-    void disable(const Arc& a) const { Parent::status(a, false); }
-
-    /// \brief Enables the given node
-    ///
-    /// This function enables the given node in the subdigraph.
-    /// It is the same as \ref status() "status(n, true)".
-    void enable(const Node& n) const { Parent::status(n, true); }
-
-    /// \brief Enables the given arc
-    ///
-    /// This function enables the given arc in the subdigraph.
-    /// It is the same as \ref status() "status(a, true)".
-    void enable(const Arc& a) const { Parent::status(a, true); }
+    /// \brief Hides the node of the graph
+    ///
+    /// This function hides \c n in the digraph, i.e. the iteration
+    /// jumps over it. This is done by simply setting the value of \c n
+    /// to be false in the corresponding node-map.
+    void hide(const Node& n) const { Parent::hide(n); }
+
+    /// \brief Hides the arc of the graph
+    ///
+    /// This function hides \c a in the digraph, i.e. the iteration
+    /// jumps over it. This is done by simply setting the value of \c a
+    /// to be false in the corresponding arc-map.
+    void hide(const Arc& a) const { Parent::hide(a); }
+
+    /// \brief Unhides the node of the graph
+    ///
+    /// The value of \c n is set to be true in the node-map which stores
+    /// hide information. If \c n was hidden previuosly, then it is shown
+    /// again
+    void unHide(const Node& n) const { Parent::unHide(n); }
+
+    /// \brief Unhides the arc of the graph
+    ///
+    /// The value of \c a is set to be true in the arc-map which stores
+    /// hide information. If \c a was hidden previuosly, then it is shown
+    /// again
+    void unHide(const Arc& a) const { Parent::unHide(a); }
+
+    /// \brief Returns true if \c n is hidden.
+    ///
+    /// Returns true if \c n is hidden.
+    ///
+    bool hidden(const Node& n) const { return Parent::hidden(n); }
+
+    /// \brief Returns true if \c a is hidden.
+    ///
+    /// Returns true if \c a is hidden.
+    ///
+    bool hidden(const Arc& a) const { return Parent::hidden(a); }
 
   };
 
-  /// \brief Returns a read-only SubDigraph adaptor
-  ///
-  /// This function just returns a read-only \ref SubDigraph adaptor.
-  /// \ingroup graph_adaptors
-  /// \relates SubDigraph
-  template<typename GR, typename NF, typename AF>
-  SubDigraph<const GR, NF, AF>
-  subDigraph(const GR& digraph,
-             NF& node_filter_map, AF& arc_filter_map) {
-    return SubDigraph<const GR, NF, AF>
-      (digraph, node_filter_map, arc_filter_map);
+  /// \brief Just gives back a subdigraph
+  ///
+  /// Just gives back a subdigraph
+  template<typename Digraph, typename NodeFilterMap, typename ArcFilterMap>
+  SubDigraph<const Digraph, NodeFilterMap, ArcFilterMap>
+  subDigraph(const Digraph& digraph, NodeFilterMap& nfm, ArcFilterMap& afm) {
+    return SubDigraph<const Digraph, NodeFilterMap, ArcFilterMap>
+      (digraph, nfm, afm);
   }
 
-  template<typename GR, typename NF, typename AF>
-  SubDigraph<const GR, const NF, AF>
-  subDigraph(const GR& digraph,
-             const NF& node_filter_map, AF& arc_filter_map) {
-    return SubDigraph<const GR, const NF, AF>
-      (digraph, node_filter_map, arc_filter_map);
+  template<typename Digraph, typename NodeFilterMap, typename ArcFilterMap>
+  SubDigraph<const Digraph, const NodeFilterMap, ArcFilterMap>
+  subDigraph(const Digraph& digraph,
+             const NodeFilterMap& nfm, ArcFilterMap& afm) {
+    return SubDigraph<const Digraph, const NodeFilterMap, ArcFilterMap>
+      (digraph, nfm, afm);
   }
 
-  template<typename GR, typename NF, typename AF>
-  SubDigraph<const GR, NF, const AF>
-  subDigraph(const GR& digraph,
-             NF& node_filter_map, const AF& arc_filter_map) {
-    return SubDigraph<const GR, NF, const AF>
-      (digraph, node_filter_map, arc_filter_map);
+  template<typename Digraph, typename NodeFilterMap, typename ArcFilterMap>
+  SubDigraph<const Digraph, NodeFilterMap, const ArcFilterMap>
+  subDigraph(const Digraph& digraph,
+             NodeFilterMap& nfm, const ArcFilterMap& afm) {
+    return SubDigraph<const Digraph, NodeFilterMap, const ArcFilterMap>
+      (digraph, nfm, afm);
   }
 
-  template<typename GR, typename NF, typename AF>
-  SubDigraph<const GR, const NF, const AF>
-  subDigraph(const GR& digraph,
-             const NF& node_filter_map, const AF& arc_filter_map) {
-    return SubDigraph<const GR, const NF, const AF>
-      (digraph, node_filter_map, arc_filter_map);
+  template<typename Digraph, typename NodeFilterMap, typename ArcFilterMap>
+  SubDigraph<const Digraph, const NodeFilterMap, const ArcFilterMap>
+  subDigraph(const Digraph& digraph,
+             const NodeFilterMap& nfm, const ArcFilterMap& afm) {
+    return SubDigraph<const Digraph, const NodeFilterMap,
+      const ArcFilterMap>(digraph, nfm, afm);
   }
 
 
-  template <typename _Graph, typename _NodeFilterMap,
-            typename _EdgeFilterMap, bool _checked = true>
+  template <typename _Graph, typename NodeFilterMap,
+            typename EdgeFilterMap, bool _checked = true>
   class SubGraphBase : public GraphAdaptorBase<_Graph> {
   public:
     typedef _Graph Graph;
-    typedef _NodeFilterMap NodeFilterMap;
-    typedef _EdgeFilterMap EdgeFilterMap;
-
     typedef SubGraphBase Adaptor;
     typedef GraphAdaptorBase<_Graph> Parent;
@@ -974 +926 @@
     }
 
-    void status(const Node& n, bool v) const { _node_filter_map->set(n, v); }
-    void status(const Edge& e, bool v) const { _edge_filter_map->set(e, v); }
-
-    bool status(const Node& n) const { return (*_node_filter_map)[n]; }
-    bool status(const Edge& e) const { return (*_edge_filter_map)[e]; }
+    void hide(const Node& n) const { _node_filter_map->set(n, false); }
+    void hide(const Edge& e) const { _edge_filter_map->set(e, false); }
+
+    void unHide(const Node& n) const { _node_filter_map->set(n, true); }
+    void unHide(const Edge& e) const { _edge_filter_map->set(e, true); }
+
+    bool hidden(const Node& n) const { return !(*_node_filter_map)[n]; }
+    bool hidden(const Edge& e) const { return !(*_edge_filter_map)[e]; }
 
     typedef False NodeNumTag;
-    typedef False ArcNumTag;
     typedef False EdgeNumTag;
 
-    typedef FindArcTagIndicator<Graph> FindArcTag;
+    typedef FindEdgeTagIndicator<Graph> FindEdgeTag;
     Arc findArc(const Node& u, const Node& v,
-                const Arc& prev = INVALID) const {
+                const Arc& prev = INVALID) {
       if (!(*_node_filter_map)[u] || !(*_node_filter_map)[v]) {
         return INVALID;
@@ -996 +950 @@
       return arc;
     }
-
-    typedef FindEdgeTagIndicator<Graph> FindEdgeTag;
     Edge findEdge(const Node& u, const Node& v,
-                  const Edge& prev = INVALID) const {
+                  const Edge& prev = INVALID) {
       if (!(*_node_filter_map)[u] || !(*_node_filter_map)[v]) {
         return INVALID;
@@ -1088 +1040 @@
   };
 
-  template <typename _Graph, typename _NodeFilterMap, typename _EdgeFilterMap>
-  class SubGraphBase<_Graph, _NodeFilterMap, _EdgeFilterMap, false>
+  template <typename _Graph, typename NodeFilterMap, typename EdgeFilterMap>
+  class SubGraphBase<_Graph, NodeFilterMap, EdgeFilterMap, false>
     : public GraphAdaptorBase<_Graph> {
   public:
     typedef _Graph Graph;
-    typedef _NodeFilterMap NodeFilterMap;
-    typedef _EdgeFilterMap EdgeFilterMap;
-
     typedef SubGraphBase Adaptor;
     typedef GraphAdaptorBase<_Graph> Parent;
@@ -1173 +1122 @@
     }
 
-    void status(const Node& n, bool v) const { _node_filter_map->set(n, v); }
-    void status(const Edge& e, bool v) const { _edge_filter_map->set(e, v); }
-
-    bool status(const Node& n) const { return (*_node_filter_map)[n]; }
-    bool status(const Edge& e) const { return (*_edge_filter_map)[e]; }
+    void hide(const Node& n) const { _node_filter_map->set(n, false); }
+    void hide(const Edge& e) const { _edge_filter_map->set(e, false); }
+
+    void unHide(const Node& n) const { _node_filter_map->set(n, true); }
+    void unHide(const Edge& e) const { _edge_filter_map->set(e, true); }
+
+    bool hidden(const Node& n) const { return !(*_node_filter_map)[n]; }
+    bool hidden(const Edge& e) const { return !(*_edge_filter_map)[e]; }
 
     typedef False NodeNumTag;
-    typedef False ArcNumTag;
     typedef False EdgeNumTag;
 
-    typedef FindArcTagIndicator<Graph> FindArcTag;
+    typedef FindEdgeTagIndicator<Graph> FindEdgeTag;
     Arc findArc(const Node& u, const Node& v,
-                const Arc& prev = INVALID) const {
+                const Arc& prev = INVALID) {
       Arc arc = Parent::findArc(u, v, prev);
       while (arc != INVALID && !(*_edge_filter_map)[arc]) {
@@ -1192 +1143 @@
       return arc;
     }
-
-    typedef FindEdgeTagIndicator<Graph> FindEdgeTag;
     Edge findEdge(const Node& u, const Node& v,
-                  const Edge& prev = INVALID) const {
+                  const Edge& prev = INVALID) {
       Edge edge = Parent::findEdge(u, v, prev);
       while (edge != INVALID && !(*_edge_filter_map)[edge]) {
@@ -1283 +1232 @@
   /// \ingroup graph_adaptors
   ///
-  /// \brief Adaptor class for hiding nodes and edges in an undirected
-  /// graph.
-  ///
-  /// SubGraph can be used for hiding nodes and edges in a graph.
-  /// A \c bool node map and a \c bool edge map must be specified, which
-  /// define the filters for nodes and edges.
-  /// Only the nodes and edges with \c true filter value are
-  /// shown in the subgraph. The edges that are incident to hidden
-  /// nodes are also filtered out.
-  /// This adaptor conforms to the \ref concepts::Graph "Graph" concept.
-  ///
-  /// The adapted graph can also be modified through this adaptor
-  /// by adding or removing nodes or edges, unless the \c GR template
-  /// parameter is set to be \c const.
-  ///
-  /// \tparam GR The type of the adapted graph.
-  /// It must conform to the \ref concepts::Graph "Graph" concept.
-  /// It can also be specified to be \c const.
-  /// \tparam NF The type of the node filter map.
-  /// It must be a \c bool (or convertible) node map of the
-  /// adapted graph. The default type is
-  /// \ref concepts::Graph::NodeMap "GR::NodeMap<bool>".
-  /// \tparam EF The type of the edge filter map.
-  /// It must be a \c bool (or convertible) edge map of the
-  /// adapted graph. The default type is
-  /// \ref concepts::Graph::EdgeMap "GR::EdgeMap<bool>".
-  ///
-  /// \note The \c Node, \c Edge and \c Arc types of this adaptor and the
-  /// adapted graph are convertible to each other.
+  /// \brief A graph adaptor for hiding nodes and edges in an
+  /// undirected graph.
+  ///
+  /// SubGraph hides nodes and edges in a graph. A bool node map and a
+  /// bool edge map must be specified, which define the filters for
+  /// nodes and edges. Just the nodes and edges with true value are
+  /// shown in the subgraph. The SubGraph is conform to the \ref
+  /// concepts::Graph "Graph concept". If the \c _checked parameter is
+  /// true, then the edges incident to filtered nodes are also
+  /// filtered out.
+  ///
+  /// \tparam _Graph It must be conform to the \ref
+  /// concepts::Graph "Graph concept". The type can be specified
+  /// to const.
+  /// \tparam _NodeFilterMap A bool valued node map of the the adapted graph.
+  /// \tparam _EdgeFilterMap A bool valued edge map of the the adapted graph.
+  /// \tparam _checked If the parameter is false then the edge filtering
+  /// is not checked with respect to node filter. Otherwise, each edge
+  /// is automatically filtered, which is incident to a filtered node.
   ///
   /// \see FilterNodes
   /// \see FilterEdges
-#ifdef DOXYGEN
-  template<typename GR, typename NF, typename EF>
-  class SubGraph {
-#else
-  template<typename GR,
-           typename NF = typename GR::template NodeMap<bool>,
-           typename EF = typename GR::template EdgeMap<bool> >
-  class SubGraph :
-    public GraphAdaptorExtender<SubGraphBase<GR, NF, EF, true> > {
-#endif
-  public:
-    /// The type of the adapted graph.
-    typedef GR Graph;
-    /// The type of the node filter map.
-    typedef NF NodeFilterMap;
-    /// The type of the edge filter map.
-    typedef EF EdgeFilterMap;
-
-    typedef GraphAdaptorExtender< SubGraphBase<GR, NF, EF, true> >
-      Parent;
+  template<typename _Graph, typename NodeFilterMap,
+           typename EdgeFilterMap, bool _checked = true>
+  class SubGraph
+    : public GraphAdaptorExtender<
+      SubGraphBase<_Graph, NodeFilterMap, EdgeFilterMap, _checked> > {
+  public:
+    typedef _Graph Graph;
+    typedef GraphAdaptorExtender<
+      SubGraphBase<_Graph, NodeFilterMap, EdgeFilterMap> > Parent;
 
     typedef typename Parent::Node Node;
@@ -1345 +1273 @@
     /// \brief Constructor
     ///
-    /// Creates a subgraph for the given graph with the given node
-    /// and edge filter maps.
-    SubGraph(Graph& graph, NodeFilterMap& node_filter_map,
+    /// Creates a subgraph for the given graph with given node and
+    /// edge map filters.
+    SubGraph(Graph& _graph, NodeFilterMap& node_filter_map,
              EdgeFilterMap& edge_filter_map) {
-      setGraph(graph);
+      setGraph(_graph);
       setNodeFilterMap(node_filter_map);
       setEdgeFilterMap(edge_filter_map);
     }
 
-    /// \brief Sets the status of the given node
-    ///
-    /// This function sets the status of the given node.
-    /// It is done by simply setting the assigned value of \c n
-    /// to \c v in the node filter map.
-    void status(const Node& n, bool v) const { Parent::status(n, v); }
-
-    /// \brief Sets the status of the given edge
-    ///
-    /// This function sets the status of the given edge.
-    /// It is done by simply setting the assigned value of \c e
-    /// to \c v in the edge filter map.
-    void status(const Edge& e, bool v) const { Parent::status(e, v); }
-
-    /// \brief Returns the status of the given node
-    ///
-    /// This function returns the status of the given node.
-    /// It is \c true if the given node is enabled (i.e. not hidden).
-    bool status(const Node& n) const { return Parent::status(n); }
-
-    /// \brief Returns the status of the given edge
-    ///
-    /// This function returns the status of the given edge.
-    /// It is \c true if the given edge is enabled (i.e. not hidden).
-    bool status(const Edge& e) const { return Parent::status(e); }
-
-    /// \brief Disables the given node
-    ///
-    /// This function disables the given node in the subdigraph,
-    /// so the iteration jumps over it.
-    /// It is the same as \ref status() "status(n, false)".
-    void disable(const Node& n) const { Parent::status(n, false); }
-
-    /// \brief Disables the given edge
-    ///
-    /// This function disables the given edge in the subgraph,
-    /// so the iteration jumps over it.
-    /// It is the same as \ref status() "status(e, false)".
-    void disable(const Edge& e) const { Parent::status(e, false); }
-
-    /// \brief Enables the given node
-    ///
-    /// This function enables the given node in the subdigraph.
-    /// It is the same as \ref status() "status(n, true)".
-    void enable(const Node& n) const { Parent::status(n, true); }
-
-    /// \brief Enables the given edge
-    ///
-    /// This function enables the given edge in the subgraph.
-    /// It is the same as \ref status() "status(e, true)".
-    void enable(const Edge& e) const { Parent::status(e, true); }
-
+    /// \brief Hides the node of the graph
+    ///
+    /// This function hides \c n in the graph, i.e. the iteration
+    /// jumps over it. This is done by simply setting the value of \c n
+    /// to be false in the corresponding node-map.
+    void hide(const Node& n) const { Parent::hide(n); }
+
+    /// \brief Hides the edge of the graph
+    ///
+    /// This function hides \c e in the graph, i.e. the iteration
+    /// jumps over it. This is done by simply setting the value of \c e
+    /// to be false in the corresponding edge-map.
+    void hide(const Edge& e) const { Parent::hide(e); }
+
+    /// \brief Unhides the node of the graph
+    ///
+    /// The value of \c n is set to be true in the node-map which stores
+    /// hide information. If \c n was hidden previuosly, then it is shown
+    /// again
+    void unHide(const Node& n) const { Parent::unHide(n); }
+
+    /// \brief Unhides the edge of the graph
+    ///
+    /// The value of \c e is set to be true in the edge-map which stores
+    /// hide information. If \c e was hidden previuosly, then it is shown
+    /// again
+    void unHide(const Edge& e) const { Parent::unHide(e); }
+
+    /// \brief Returns true if \c n is hidden.
+    ///
+    /// Returns true if \c n is hidden.
+    ///
+    bool hidden(const Node& n) const { return Parent::hidden(n); }
+
+    /// \brief Returns true if \c e is hidden.
+    ///
+    /// Returns true if \c e is hidden.
+    ///
+    bool hidden(const Edge& e) const { return Parent::hidden(e); }
   };
 
-  /// \brief Returns a read-only SubGraph adaptor
-  ///
-  /// This function just returns a read-only \ref SubGraph adaptor.
+  /// \brief Just gives back a subgraph
+  ///
+  /// Just gives back a subgraph
+  template<typename Graph, typename NodeFilterMap, typename ArcFilterMap>
+  SubGraph<const Graph, NodeFilterMap, ArcFilterMap>
+  subGraph(const Graph& graph, NodeFilterMap& nfm, ArcFilterMap& efm) {
+    return SubGraph<const Graph, NodeFilterMap, ArcFilterMap>(graph, nfm, efm);
+  }
+
+  template<typename Graph, typename NodeFilterMap, typename ArcFilterMap>
+  SubGraph<const Graph, const NodeFilterMap, ArcFilterMap>
+  subGraph(const Graph& graph,
+           const NodeFilterMap& nfm, ArcFilterMap& efm) {
+    return SubGraph<const Graph, const NodeFilterMap, ArcFilterMap>
+      (graph, nfm, efm);
+  }
+
+  template<typename Graph, typename NodeFilterMap, typename ArcFilterMap>
+  SubGraph<const Graph, NodeFilterMap, const ArcFilterMap>
+  subGraph(const Graph& graph,
+           NodeFilterMap& nfm, const ArcFilterMap& efm) {
+    return SubGraph<const Graph, NodeFilterMap, const ArcFilterMap>
+      (graph, nfm, efm);
+  }
+
+  template<typename Graph, typename NodeFilterMap, typename ArcFilterMap>
+  SubGraph<const Graph, const NodeFilterMap, const ArcFilterMap>
+  subGraph(const Graph& graph,
+           const NodeFilterMap& nfm, const ArcFilterMap& efm) {
+    return SubGraph<const Graph, const NodeFilterMap, const ArcFilterMap>
+      (graph, nfm, efm);
+  }
+
   /// \ingroup graph_adaptors
-  /// \relates SubGraph
-  template<typename GR, typename NF, typename EF>
-  SubGraph<const GR, NF, EF>
-  subGraph(const GR& graph,
-           NF& node_filter_map, EF& edge_filter_map) {
-    return SubGraph<const GR, NF, EF>
-      (graph, node_filter_map, edge_filter_map);
-  }
-
-  template<typename GR, typename NF, typename EF>
-  SubGraph<const GR, const NF, EF>
-  subGraph(const GR& graph,
-           const NF& node_filter_map, EF& edge_filter_map) {
-    return SubGraph<const GR, const NF, EF>
-      (graph, node_filter_map, edge_filter_map);
-  }
-
-  template<typename GR, typename NF, typename EF>
-  SubGraph<const GR, NF, const EF>
-  subGraph(const GR& graph,
-           NF& node_filter_map, const EF& edge_filter_map) {
-    return SubGraph<const GR, NF, const EF>
-      (graph, node_filter_map, edge_filter_map);
-  }
-
-  template<typename GR, typename NF, typename EF>
-  SubGraph<const GR, const NF, const EF>
-  subGraph(const GR& graph,
-           const NF& node_filter_map, const EF& edge_filter_map) {
-    return SubGraph<const GR, const NF, const EF>
-      (graph, node_filter_map, edge_filter_map);
-  }
-
-
-  /// \ingroup graph_adaptors
-  ///
-  /// \brief Adaptor class for hiding nodes in a digraph or a graph.
-  ///
-  /// FilterNodes adaptor can be used for hiding nodes in a digraph or a
-  /// graph. A \c bool node map must be specified, which defines the filter
-  /// for the nodes. Only the nodes with \c true filter value and the
-  /// arcs/edges incident to nodes both with \c true filter value are shown
-  /// in the subgraph. This adaptor conforms to the \ref concepts::Digraph
-  /// "Digraph" concept or the \ref concepts::Graph "Graph" concept
-  /// depending on the \c GR template parameter.
-  ///
-  /// The adapted (di)graph can also be modified through this adaptor
-  /// by adding or removing nodes or arcs/edges, unless the \c GR template
-  /// parameter is set to be \c const.
-  ///
-  /// \tparam GR The type of the adapted digraph or graph.
-  /// It must conform to the \ref concepts::Digraph "Digraph" concept
-  /// or the \ref concepts::Graph "Graph" concept.
-  /// It can also be specified to be \c const.
-  /// \tparam NF The type of the node filter map.
-  /// It must be a \c bool (or convertible) node map of the
-  /// adapted (di)graph. The default type is
-  /// \ref concepts::Graph::NodeMap "GR::NodeMap<bool>".
-  ///
-  /// \note The \c Node and <tt>Arc/Edge</tt> types of this adaptor and the
-  /// adapted (di)graph are convertible to each other.
+  ///
+  /// \brief An adaptor for hiding nodes from a digraph or a graph.
+  ///
+  /// FilterNodes adaptor hides nodes in a graph or a digraph. A bool
+  /// node map must be specified, which defines the filters for
+  /// nodes. Just the unfiltered nodes and the arcs or edges incident
+  /// to unfiltered nodes are shown in the subdigraph or subgraph. The
+  /// FilterNodes is conform to the \ref concepts::Digraph
+  /// "Digraph concept" or \ref concepts::Graph "Graph concept" depending
+  /// on the \c _Digraph template parameter. If the \c _checked
+  /// parameter is true, then the arc or edges incident to filtered nodes
+  /// are also filtered out.
+  ///
+  /// \tparam _Digraph It must be conform to the \ref
+  /// concepts::Digraph "Digraph concept" or \ref concepts::Graph
+  /// "Graph concept". The type can be specified to be const.
+  /// \tparam _NodeFilterMap A bool valued node map of the the adapted graph.
+  /// \tparam _checked If the parameter is false then the arc or edge
+  /// filtering is not checked with respect to node filter. In this
+  /// case just isolated nodes can be filtered out from the
+  /// graph.
 #ifdef DOXYGEN
-  template<typename GR, typename NF>
-  class FilterNodes {
+  template<typename _Digraph,
+           typename _NodeFilterMap = typename _Digraph::template NodeMap<bool>,
+           bool _checked = true>
 #else
-  template<typename GR,
-           typename NF = typename GR::template NodeMap<bool>,
+  template<typename _Digraph,
+           typename _NodeFilterMap = typename _Digraph::template NodeMap<bool>,
+           bool _checked = true,
            typename Enable = void>
-  class FilterNodes :
-    public DigraphAdaptorExtender<
-      SubDigraphBase<GR, NF, ConstMap<typename GR::Arc, bool>, true> > {
 #endif
-  public:
-
-    typedef GR Digraph;
-    typedef NF NodeFilterMap;
-
-    typedef DigraphAdaptorExtender<
-      SubDigraphBase<GR, NF, ConstMap<typename GR::Arc, bool>, true> >
-      Parent;
+  class FilterNodes
+    : public SubDigraph<_Digraph, _NodeFilterMap,
+                        ConstMap<typename _Digraph::Arc, bool>, _checked> {
+  public:
+
+    typedef _Digraph Digraph;
+    typedef _NodeFilterMap NodeFilterMap;
+
+    typedef SubDigraph<Digraph, NodeFilterMap,
+                       ConstMap<typename Digraph::Arc, bool>, _checked>
+    Parent;
 
     typedef typename Parent::Node Node;
@@ -1506 +1413 @@
     /// \brief Constructor
     ///
-    /// Creates a subgraph for the given digraph or graph with the
+    /// Creates an adaptor for the given digraph or graph with
     /// given node filter map.
-    FilterNodes(GR& graph, NodeFilterMap& node_filter) :
-      Parent(), const_true_map(true)
-    {
-      Parent::setDigraph(graph);
+    FilterNodes(Digraph& _digraph, NodeFilterMap& node_filter) :
+      Parent(), const_true_map(true) {
+      Parent::setDigraph(_digraph);
       Parent::setNodeFilterMap(node_filter);
       Parent::setArcFilterMap(const_true_map);
     }
 
-    /// \brief Sets the status of the given node
-    ///
-    /// This function sets the status of the given node.
-    /// It is done by simply setting the assigned value of \c n
-    /// to \c v in the node filter map.
-    void status(const Node& n, bool v) const { Parent::status(n, v); }
-
-    /// \brief Returns the status of the given node
-    ///
-    /// This function returns the status of the given node.
-    /// It is \c true if the given node is enabled (i.e. not hidden).
-    bool status(const Node& n) const { return Parent::status(n); }
-
-    /// \brief Disables the given node
-    ///
-    /// This function disables the given node, so the iteration
-    /// jumps over it.
-    /// It is the same as \ref status() "status(n, false)".
-    void disable(const Node& n) const { Parent::status(n, false); }
-
-    /// \brief Enables the given node
-    ///
-    /// This function enables the given node.
-    /// It is the same as \ref status() "status(n, true)".
-    void enable(const Node& n) const { Parent::status(n, true); }
+    /// \brief Hides the node of the graph
+    ///
+    /// This function hides \c n in the digraph or graph, i.e. the iteration
+    /// jumps over it. This is done by simply setting the value of \c n
+    /// to be false in the corresponding node map.
+    void hide(const Node& n) const { Parent::hide(n); }
+
+    /// \brief Unhides the node of the graph
+    ///
+    /// The value of \c n is set to be true in the node-map which stores
+    /// hide information. If \c n was hidden previuosly, then it is shown
+    /// again
+    void unHide(const Node& n) const { Parent::unHide(n); }
+
+    /// \brief Returns true if \c n is hidden.
+    ///
+    /// Returns true if \c n is hidden.
+    ///
+    bool hidden(const Node& n) const { return Parent::hidden(n); }
 
   };
 
-  template<typename GR, typename NF>
-  class FilterNodes<GR, NF,
-                    typename enable_if<UndirectedTagIndicator<GR> >::type> :
-    public GraphAdaptorExtender<
-      SubGraphBase<GR, NF, ConstMap<typename GR::Edge, bool>, true> > {
-
-  public:
-    typedef GR Graph;
-    typedef NF NodeFilterMap;
-    typedef GraphAdaptorExtender<
-      SubGraphBase<GR, NF, ConstMap<typename GR::Edge, bool>, true> >
-      Parent;
+  template<typename _Graph, typename _NodeFilterMap, bool _checked>
+  class FilterNodes<_Graph, _NodeFilterMap, _checked,
+                    typename enable_if<UndirectedTagIndicator<_Graph> >::type>
+    : public SubGraph<_Graph, _NodeFilterMap,
+                      ConstMap<typename _Graph::Edge, bool>, _checked> {
+  public:
+    typedef _Graph Graph;
+    typedef _NodeFilterMap NodeFilterMap;
+    typedef SubGraph<Graph, NodeFilterMap,
+                     ConstMap<typename Graph::Edge, bool> > Parent;
 
     typedef typename Parent::Node Node;
@@ -1574 +1472 @@
     }
 
-    void status(const Node& n, bool v) const { Parent::status(n, v); }
-    bool status(const Node& n) const { return Parent::status(n); }
-    void disable(const Node& n) const { Parent::status(n, false); }
-    void enable(const Node& n) const { Parent::status(n, true); }
+    void hide(const Node& n) const { Parent::hide(n); }
+    void unHide(const Node& n) const { Parent::unHide(n); }
+    bool hidden(const Node& n) const { return Parent::hidden(n); }
 
   };
 
 
-  /// \brief Returns a read-only FilterNodes adaptor
-  ///
-  /// This function just returns a read-only \ref FilterNodes adaptor.
+  /// \brief Just gives back a FilterNodes adaptor
+  ///
+  /// Just gives back a FilterNodes adaptor
+  template<typename Digraph, typename NodeFilterMap>
+  FilterNodes<const Digraph, NodeFilterMap>
+  filterNodes(const Digraph& digraph, NodeFilterMap& nfm) {
+    return FilterNodes<const Digraph, NodeFilterMap>(digraph, nfm);
+  }
+
+  template<typename Digraph, typename NodeFilterMap>
+  FilterNodes<const Digraph, const NodeFilterMap>
+  filterNodes(const Digraph& digraph, const NodeFilterMap& nfm) {
+    return FilterNodes<const Digraph, const NodeFilterMap>(digraph, nfm);
+  }
+
   /// \ingroup graph_adaptors
-  /// \relates FilterNodes
-  template<typename GR, typename NF>
-  FilterNodes<const GR, NF>
-  filterNodes(const GR& graph, NF& node_filter_map) {
-    return FilterNodes<const GR, NF>(graph, node_filter_map);
-  }
-
-  template<typename GR, typename NF>
-  FilterNodes<const GR, const NF>
-  filterNodes(const GR& graph, const NF& node_filter_map) {
-    return FilterNodes<const GR, const NF>(graph, node_filter_map);
-  }
-
-  /// \ingroup graph_adaptors
-  ///
-  /// \brief Adaptor class for hiding arcs in a digraph.
-  ///
-  /// FilterArcs adaptor can be used for hiding arcs in a digraph.
-  /// A \c bool arc map must be specified, which defines the filter for
-  /// the arcs. Only the arcs with \c true filter value are shown in the
-  /// subdigraph. This adaptor conforms to the \ref concepts::Digraph
-  /// "Digraph" concept.
-  ///
-  /// The adapted digraph can also be modified through this adaptor
-  /// by adding or removing nodes or arcs, unless the \c GR template
-  /// parameter is set to be \c const.
-  ///
-  /// \tparam GR The type of the adapted digraph.
-  /// It must conform to the \ref concepts::Digraph "Digraph" concept.
-  /// It can also be specified to be \c const.
-  /// \tparam AF The type of the arc filter map.
-  /// It must be a \c bool (or convertible) arc map of the
-  /// adapted digraph. The default type is
-  /// \ref concepts::Digraph::ArcMap "GR::ArcMap<bool>".
-  ///
-  /// \note The \c Node and \c Arc types of this adaptor and the adapted
-  /// digraph are convertible to each other.
-#ifdef DOXYGEN
-  template<typename GR,
-           typename AF>
-  class FilterArcs {
-#else
-  template<typename GR,
-           typename AF = typename GR::template ArcMap<bool> >
+  ///
+  /// \brief An adaptor for hiding arcs from a digraph.
+  ///
+  /// FilterArcs adaptor hides arcs in a digraph. A bool arc map must
+  /// be specified, which defines the filters for arcs. Just the
+  /// unfiltered arcs are shown in the subdigraph. The FilterArcs is
+  /// conform to the \ref concepts::Digraph "Digraph concept".
+  ///
+  /// \tparam _Digraph It must be conform to the \ref concepts::Digraph
+  /// "Digraph concept". The type can be specified to be const.
+  /// \tparam _ArcFilterMap A bool valued arc map of the the adapted
+  /// graph.
+  template<typename _Digraph, typename _ArcFilterMap>
   class FilterArcs :
-    public DigraphAdaptorExtender<
-      SubDigraphBase<GR, ConstMap<typename GR::Node, bool>, AF, false> > {
-#endif
-  public:
-    /// The type of the adapted digraph.
-    typedef GR Digraph;
-    /// The type of the arc filter map.
-    typedef AF ArcFilterMap;
-
-    typedef DigraphAdaptorExtender<
-      SubDigraphBase<GR, ConstMap<typename GR::Node, bool>, AF, false> >
-      Parent;
+    public SubDigraph<_Digraph, ConstMap<typename _Digraph::Node, bool>,
+                      _ArcFilterMap, false> {
+  public:
+    typedef _Digraph Digraph;
+    typedef _ArcFilterMap ArcFilterMap;
+
+    typedef SubDigraph<Digraph, ConstMap<typename Digraph::Node, bool>,
+                       ArcFilterMap, false> Parent;
 
     typedef typename Parent::Arc Arc;
@@ -1657 +1531 @@
     /// \brief Constructor
     ///
-    /// Creates a subdigraph for the given digraph with the given arc
-    /// filter map.
+    /// Creates a FilterArcs adaptor for the given graph with
+    /// given arc map filter.
     FilterArcs(Digraph& digraph, ArcFilterMap& arc_filter)
       : Parent(), const_true_map(true) {
@@ -1666 +1540 @@
     }
 
-    /// \brief Sets the status of the given arc
-    ///
-    /// This function sets the status of the given arc.
-    /// It is done by simply setting the assigned value of \c a
-    /// to \c v in the arc filter map.
-    void status(const Arc& a, bool v) const { Parent::status(a, v); }
-
-    /// \brief Returns the status of the given arc
-    ///
-    /// This function returns the status of the given arc.
-    /// It is \c true if the given arc is enabled (i.e. not hidden).
-    bool status(const Arc& a) const { return Parent::status(a); }
-
-    /// \brief Disables the given arc
-    ///
-    /// This function disables the given arc in the subdigraph,
-    /// so the iteration jumps over it.
-    /// It is the same as \ref status() "status(a, false)".
-    void disable(const Arc& a) const { Parent::status(a, false); }
-
-    /// \brief Enables the given arc
-    ///
-    /// This function enables the given arc in the subdigraph.
-    /// It is the same as \ref status() "status(a, true)".
-    void enable(const Arc& a) const { Parent::status(a, true); }
+    /// \brief Hides the arc of the graph
+    ///
+    /// This function hides \c a in the graph, i.e. the iteration
+    /// jumps over it. This is done by simply setting the value of \c a
+    /// to be false in the corresponding arc map.
+    void hide(const Arc& a) const { Parent::hide(a); }
+
+    /// \brief Unhides the arc of the graph
+    ///
+    /// The value of \c a is set to be true in the arc-map which stores
+    /// hide information. If \c a was hidden previuosly, then it is shown
+    /// again
+    void unHide(const Arc& a) const { Parent::unHide(a); }
+
+    /// \brief Returns true if \c a is hidden.
+    ///
+    /// Returns true if \c a is hidden.
+    ///
+    bool hidden(const Arc& a) const { return Parent::hidden(a); }
 
   };
 
-  /// \brief Returns a read-only FilterArcs adaptor
-  ///
-  /// This function just returns a read-only \ref FilterArcs adaptor.
+  /// \brief Just gives back an FilterArcs adaptor
+  ///
+  /// Just gives back an FilterArcs adaptor
+  template<typename Digraph, typename ArcFilterMap>
+  FilterArcs<const Digraph, ArcFilterMap>
+  filterArcs(const Digraph& digraph, ArcFilterMap& afm) {
+    return FilterArcs<const Digraph, ArcFilterMap>(digraph, afm);
+  }
+
+  template<typename Digraph, typename ArcFilterMap>
+  FilterArcs<const Digraph, const ArcFilterMap>
+  filterArcs(const Digraph& digraph, const ArcFilterMap& afm) {
+    return FilterArcs<const Digraph, const ArcFilterMap>(digraph, afm);
+  }
+
   /// \ingroup graph_adaptors
-  /// \relates FilterArcs
-  template<typename GR, typename AF>
-  FilterArcs<const GR, AF>
-  filterArcs(const GR& digraph, AF& arc_filter_map) {
-    return FilterArcs<const GR, AF>(digraph, arc_filter_map);
-  }
-
-  template<typename GR, typename AF>
-  FilterArcs<const GR, const AF>
-  filterArcs(const GR& digraph, const AF& arc_filter_map) {
-    return FilterArcs<const GR, const AF>(digraph, arc_filter_map);
-  }
-
-  /// \ingroup graph_adaptors
-  ///
-  /// \brief Adaptor class for hiding edges in a graph.
-  ///
-  /// FilterEdges adaptor can be used for hiding edges in a graph.
-  /// A \c bool edge map must be specified, which defines the filter for
-  /// the edges. Only the edges with \c true filter value are shown in the
-  /// subgraph. This adaptor conforms to the \ref concepts::Graph
-  /// "Graph" concept.
-  ///
-  /// The adapted graph can also be modified through this adaptor
-  /// by adding or removing nodes or edges, unless the \c GR template
-  /// parameter is set to be \c const.
-  ///
-  /// \tparam GR The type of the adapted graph.
-  /// It must conform to the \ref concepts::Graph "Graph" concept.
-  /// It can also be specified to be \c const.
-  /// \tparam EF The type of the edge filter map.
-  /// It must be a \c bool (or convertible) edge map of the
-  /// adapted graph. The default type is
-  /// \ref concepts::Graph::EdgeMap "GR::EdgeMap<bool>".
-  ///
-  /// \note The \c Node, \c Edge and \c Arc types of this adaptor and the
-  /// adapted graph are convertible to each other.
-#ifdef DOXYGEN
-  template<typename GR,
-           typename EF>
-  class FilterEdges {
-#else
-  template<typename GR,
-           typename EF = typename GR::template EdgeMap<bool> >
+  ///
+  /// \brief An adaptor for hiding edges from a graph.
+  ///
+  /// FilterEdges adaptor hides edges in a digraph. A bool edge map must
+  /// be specified, which defines the filters for edges. Just the
+  /// unfiltered edges are shown in the subdigraph. The FilterEdges is
+  /// conform to the \ref concepts::Graph "Graph concept".
+  ///
+  /// \tparam _Graph It must be conform to the \ref concepts::Graph
+  /// "Graph concept". The type can be specified to be const.
+  /// \tparam _EdgeFilterMap A bool valued edge map of the the adapted
+  /// graph.
+  template<typename _Graph, typename _EdgeFilterMap>
   class FilterEdges :
-    public GraphAdaptorExtender<
-      SubGraphBase<GR, ConstMap<typename GR::Node,bool>, EF, false> > {
-#endif
-  public:
-    /// The type of the adapted graph.
-    typedef GR Graph;
-    /// The type of the edge filter map.
-    typedef EF EdgeFilterMap;
-
-    typedef GraphAdaptorExtender<
-      SubGraphBase<GR, ConstMap<typename GR::Node,bool>, EF, false> >
-      Parent;
-
+    public SubGraph<_Graph, ConstMap<typename _Graph::Node,bool>,
+                    _EdgeFilterMap, false> {
+  public:
+    typedef _Graph Graph;
+    typedef _EdgeFilterMap EdgeFilterMap;
+    typedef SubGraph<Graph, ConstMap<typename Graph::Node,bool>,
+                     EdgeFilterMap, false> Parent;
     typedef typename Parent::Edge Edge;
-
   protected:
     ConstMap<typename Graph::Node, bool> const_true_map;
@@ -1769 +1611 @@
     /// \brief Constructor
     ///
-    /// Creates a subgraph for the given graph with the given edge
-    /// filter map.
-    FilterEdges(Graph& graph, EdgeFilterMap& edge_filter_map) :
+    /// Creates a FilterEdges adaptor for the given graph with
+    /// given edge map filters.
+    FilterEdges(Graph& _graph, EdgeFilterMap& edge_filter_map) :
       Parent(), const_true_map(true) {
-      Parent::setGraph(graph);
+      Parent::setGraph(_graph);
       Parent::setNodeFilterMap(const_true_map);
       Parent::setEdgeFilterMap(edge_filter_map);
     }
 
-    /// \brief Sets the status of the given edge
-    ///
-    /// This function sets the status of the given edge.
-    /// It is done by simply setting the assigned value of \c e
-    /// to \c v in the edge filter map.
-    void status(const Edge& e, bool v) const { Parent::status(e, v); }
-
-    /// \brief Returns the status of the given edge
-    ///
-    /// This function returns the status of the given edge.
-    /// It is \c true if the given edge is enabled (i.e. not hidden).
-    bool status(const Edge& e) const { return Parent::status(e); }
-
-    /// \brief Disables the given edge
-    ///
-    /// This function disables the given edge in the subgraph,
-    /// so the iteration jumps over it.
-    /// It is the same as \ref status() "status(e, false)".
-    void disable(const Edge& e) const { Parent::status(e, false); }
-
-    /// \brief Enables the given edge
-    ///
-    /// This function enables the given edge in the subgraph.
-    /// It is the same as \ref status() "status(e, true)".
-    void enable(const Edge& e) const { Parent::status(e, true); }
+    /// \brief Hides the edge of the graph
+    ///
+    /// This function hides \c e in the graph, i.e. the iteration
+    /// jumps over it. This is done by simply setting the value of \c e
+    /// to be false in the corresponding edge-map.
+    void hide(const Edge& e) const { Parent::hide(e); }
+
+    /// \brief Unhides the edge of the graph
+    ///
+    /// The value of \c e is set to be true in the edge-map which stores
+    /// hide information. If \c e was hidden previuosly, then it is shown
+    /// again
+    void unHide(const Edge& e) const { Parent::unHide(e); }
+
+    /// \brief Returns true if \c e is hidden.
+    ///
+    /// Returns true if \c e is hidden.
+    ///
+    bool hidden(const Edge& e) const { return Parent::hidden(e); }
 
   };
 
-  /// \brief Returns a read-only FilterEdges adaptor
-  ///
-  /// This function just returns a read-only \ref FilterEdges adaptor.
-  /// \ingroup graph_adaptors
-  /// \relates FilterEdges
-  template<typename GR, typename EF>
-  FilterEdges<const GR, EF>
-  filterEdges(const GR& graph, EF& edge_filter_map) {
-    return FilterEdges<const GR, EF>(graph, edge_filter_map);
+  /// \brief Just gives back a FilterEdges adaptor
+  ///
+  /// Just gives back a FilterEdges adaptor
+  template<typename Graph, typename EdgeFilterMap>
+  FilterEdges<const Graph, EdgeFilterMap>
+  filterEdges(const Graph& graph, EdgeFilterMap& efm) {
+    return FilterEdges<const Graph, EdgeFilterMap>(graph, efm);
   }
 
-  template<typename GR, typename EF>
-  FilterEdges<const GR, const EF>
-  filterEdges(const GR& graph, const EF& edge_filter_map) {
-    return FilterEdges<const GR, const EF>(graph, edge_filter_map);
+  template<typename Graph, typename EdgeFilterMap>
+  FilterEdges<const Graph, const EdgeFilterMap>
+  filterEdges(const Graph& graph, const EdgeFilterMap& efm) {
+    return FilterEdges<const Graph, const EdgeFilterMap>(graph, efm);
   }
-
 
   template <typename _Digraph>
@@ -1862 +1695 @@
       }
     };
+
+
 
     void first(Node& n) const {
@@ -2011 +1846 @@
 
     typedef NodeNumTagIndicator<Digraph> NodeNumTag;
-    int nodeNum() const { return _digraph->nodeNum(); }
-
-    typedef ArcNumTagIndicator<Digraph> ArcNumTag;
+    int nodeNum() const { return 2 * _digraph->arcNum(); }
+    typedef EdgeNumTagIndicator<Digraph> EdgeNumTag;
     int arcNum() const { return 2 * _digraph->arcNum(); }
-
-    typedef ArcNumTag EdgeNumTag;
     int edgeNum() const { return _digraph->arcNum(); }
 
-    typedef FindArcTagIndicator<Digraph> FindArcTag;
+    typedef FindEdgeTagIndicator<Digraph> FindEdgeTag;
     Arc findArc(Node s, Node t, Arc p = INVALID) const {
       if (p == INVALID) {
@@ -2038 +1870 @@
     }
 
-    typedef FindArcTag FindEdgeTag;
     Edge findEdge(Node s, Node t, Edge p = INVALID) const {
       if (s != t) {
@@ -2046 +1877 @@
           arc = _digraph->findArc(t, s);
           if (arc != INVALID) return arc;
-        } else if (_digraph->source(p) == s) {
+        } else if (_digraph->s(p) == s) {
           Edge arc = _digraph->findArc(s, t, p);
           if (arc != INVALID) return arc;
@@ -2075 +1906 @@
       typedef _Value Value;
       typedef Arc Key;
-      typedef typename MapTraits<MapImpl>::ConstReturnValue ConstReturnValue;
-      typedef typename MapTraits<MapImpl>::ReturnValue ReturnValue;
-      typedef typename MapTraits<MapImpl>::ConstReturnValue ConstReference;
-      typedef typename MapTraits<MapImpl>::ReturnValue Reference;
 
       ArcMapBase(const Adaptor& adaptor) :
@@ -2094 +1921 @@
       }
 
-      ConstReturnValue operator[](const Arc& a) const {
+      typename MapTraits<MapImpl>::ConstReturnValue
+      operator[](const Arc& a) const {
         if (direction(a)) {
           return _forward[a];
@@ -2102 +1930 @@
       }
 
-      ReturnValue operator[](const Arc& a) {
+      typename MapTraits<MapImpl>::ReturnValue
+      operator[](const Arc& a) {
         if (direction(a)) {
           return _forward[a];
@@ -2152 +1981 @@
       typedef SubMapExtender<Adaptor, ArcMapBase<Value> > Parent;
 
-      explicit ArcMap(const Adaptor& adaptor)
+      ArcMap(const Adaptor& adaptor)
         : Parent(adaptor) {}
 
@@ -2199 +2028 @@
     NodeNotifier& notifier(Node) const { return _digraph->notifier(Node()); }
 
-    typedef typename ItemSetTraits<Digraph, Edge>::ItemNotifier EdgeNotifier;
-    EdgeNotifier& notifier(Edge) const { return _digraph->notifier(Edge()); }
-
   protected:
 
@@ -2216 +2042 @@
   /// \ingroup graph_adaptors
   ///
-  /// \brief Adaptor class for viewing a digraph as an undirected graph.
-  ///
-  /// Undirector adaptor can be used for viewing a digraph as an undirected
-  /// graph. All arcs of the underlying digraph are showed in the
-  /// adaptor as an edge (and also as a pair of arcs, of course).
-  /// This adaptor conforms to the \ref concepts::Graph "Graph" concept.
-  ///
-  /// The adapted digraph can also be modified through this adaptor
-  /// by adding or removing nodes or edges, unless the \c GR template
-  /// parameter is set to be \c const.
-  ///
-  /// \tparam GR The type of the adapted digraph.
-  /// It must conform to the \ref concepts::Digraph "Digraph" concept.
-  /// It can also be specified to be \c const.
-  ///
-  /// \note The \c Node type of this adaptor and the adapted digraph are
-  /// convertible to each other, moreover the \c Edge type of the adaptor
-  /// and the \c Arc type of the adapted digraph are also convertible to
-  /// each other.
-  /// (Thus the \c Arc type of the adaptor is convertible to the \c Arc type
-  /// of the adapted digraph.)
-  template<typename GR>
-#ifdef DOXYGEN
-  class Undirector {
-#else
-  class Undirector :
-    public GraphAdaptorExtender<UndirectorBase<GR> > {
-#endif
-  public:
-    /// The type of the adapted digraph.
-    typedef GR Digraph;
-    typedef GraphAdaptorExtender<UndirectorBase<GR> > Parent;
+  /// \brief Undirect the graph
+  ///
+  /// This adaptor makes an undirected graph from a directed
+  /// graph. All arcs of the underlying digraph will be showed in the
+  /// adaptor as an edge. The Orienter adaptor is conform to the \ref
+  /// concepts::Graph "Graph concept".
+  ///
+  /// \tparam _Digraph It must be conform to the \ref
+  /// concepts::Digraph "Digraph concept". The type can be specified
+  /// to const.
+  template<typename _Digraph>
+  class Undirector
+    : public GraphAdaptorExtender<UndirectorBase<_Digraph> > {
+  public:
+    typedef _Digraph Digraph;
+    typedef GraphAdaptorExtender<UndirectorBase<Digraph> > Parent;
   protected:
     Undirector() { }
@@ -2254 +2064 @@
     /// \brief Constructor
     ///
-    /// Creates an undirected graph from the given digraph.
-    Undirector(Digraph& digraph) {
+    /// Creates a undirected graph from the given digraph
+    Undirector(_Digraph& digraph) {
       setDigraph(digraph);
     }
 
-    /// \brief Arc map combined from two original arc maps
-    ///
-    /// This map adaptor class adapts two arc maps of the underlying
-    /// digraph to get an arc map of the undirected graph.
-    /// Its value type is inherited from the first arc map type
-    /// (\c %ForwardMap).
-    template <typename ForwardMap, typename BackwardMap>
+    /// \brief ArcMap combined from two original ArcMap
+    ///
+    /// This class adapts two original digraph ArcMap to
+    /// get an arc map on the undirected graph.
+    template <typename _ForwardMap, typename _BackwardMap>
     class CombinedArcMap {
     public:
 
-      /// The key type of the map
+      typedef _ForwardMap ForwardMap;
+      typedef _BackwardMap BackwardMap;
+
+      typedef typename MapTraits<ForwardMap>::ReferenceMapTag ReferenceMapTag;
+
+      typedef typename ForwardMap::Value Value;
       typedef typename Parent::Arc Key;
-      /// The value type of the map
-      typedef typename ForwardMap::Value Value;
-
-      typedef typename MapTraits<ForwardMap>::ReferenceMapTag ReferenceMapTag;
-
-      typedef typename MapTraits<ForwardMap>::ReturnValue ReturnValue;
-      typedef typename MapTraits<ForwardMap>::ConstReturnValue ConstReturnValue;
-      typedef typename MapTraits<ForwardMap>::ReturnValue Reference;
-      typedef typename MapTraits<ForwardMap>::ConstReturnValue ConstReference;
-
+
+      /// \brief Constructor
+      ///
       /// Constructor
       CombinedArcMap(ForwardMap& forward, BackwardMap& backward)
         : _forward(&forward), _backward(&backward) {}
 
-      /// Sets the value associated with the given key.
+
+      /// \brief Sets the value associated with a key.
+      ///
+      /// Sets the value associated with a key.
       void set(const Key& e, const Value& a) {
         if (Parent::direction(e)) {
@@ -2294 +2103 @@
       }
 
-      /// Returns the value associated with the given key.
-      ConstReturnValue operator[](const Key& e) const {
+      /// \brief Returns the value associated with a key.
+      ///
+      /// Returns the value associated with a key.
+      typename MapTraits<ForwardMap>::ConstReturnValue
+      operator[](const Key& e) const {
         if (Parent::direction(e)) {
           return (*_forward)[e];
@@ -2303 +2115 @@
       }
 
-      /// Returns a reference to the value associated with the given key.
-      ReturnValue operator[](const Key& e) {
+      /// \brief Returns the value associated with a key.
+      ///
+      /// Returns the value associated with a key.
+      typename MapTraits<ForwardMap>::ReturnValue
+      operator[](const Key& e) {
         if (Parent::direction(e)) {
           return (*_forward)[e];
@@ -2319 +2134 @@
     };
 
-    /// \brief Returns a combined arc map
-    ///
-    /// This function just returns a combined arc map.
+    /// \brief Just gives back a combined arc map
+    ///
+    /// Just gives back a combined arc map
     template <typename ForwardMap, typename BackwardMap>
     static CombinedArcMap<ForwardMap, BackwardMap>
@@ -2351 +2166 @@
   };
 
-  /// \brief Returns a read-only Undirector adaptor
-  ///
-  /// This function just returns a read-only \ref Undirector adaptor.
-  /// \ingroup graph_adaptors
-  /// \relates Undirector
-  template<typename GR>
-  Undirector<const GR> undirector(const GR& digraph) {
-    return Undirector<const GR>(digraph);
+  /// \brief Just gives back an undirected view of the given digraph
+  ///
+  /// Just gives back an undirected view of the given digraph
+  template<typename Digraph>
+  Undirector<const Digraph>
+  undirector(const Digraph& digraph) {
+    return Undirector<const Digraph>(digraph);
   }
-
 
   template <typename _Graph, typename _DirectionMap>
@@ -2379 +2192 @@
     void first(Arc& i) const { _graph->first(i); }
     void firstIn(Arc& i, const Node& n) const {
-      bool d = true;
+      bool d;
       _graph->firstInc(i, d, n);
       while (i != INVALID && d == (*_direction)[i]) _graph->nextInc(i, d);
     }
     void firstOut(Arc& i, const Node& n ) const {
-      bool d = true;
+      bool d;
       _graph->firstInc(i, d, n);
       while (i != INVALID && d != (*_direction)[i]) _graph->nextInc(i, d);
@@ -2412 +2225 @@
     int nodeNum() const { return _graph->nodeNum(); }
 
-    typedef EdgeNumTagIndicator<Graph> ArcNumTag;
+    typedef EdgeNumTagIndicator<Graph> EdgeNumTag;
     int arcNum() const { return _graph->edgeNum(); }
 
-    typedef FindEdgeTagIndicator<Graph> FindArcTag;
+    typedef FindEdgeTagIndicator<Graph> FindEdgeTag;
     Arc findArc(const Node& u, const Node& v,
-                const Arc& prev = INVALID) const {
-      Arc arc = _graph->findEdge(u, v, prev);
-      while (arc != INVALID && source(arc) != u) {
+                const Arc& prev = INVALID) {
+      Arc arc = prev;
+      bool d = arc == INVALID ? true : (*_direction)[arc];
+      if (d) {
         arc = _graph->findEdge(u, v, arc);
+        while (arc != INVALID && !(*_direction)[arc]) {
+          _graph->findEdge(u, v, arc);
+        }
+        if (arc != INVALID) return arc;
+      }
+      _graph->findEdge(v, u, arc);
+      while (arc != INVALID && (*_direction)[arc]) {
+        _graph->findEdge(u, v, arc);
       }
       return arc;
@@ -2430 +2252 @@
 
     Arc addArc(const Node& u, const Node& v) {
-      Arc arc = _graph->addEdge(u, v);
-      _direction->set(arc, _graph->u(arc) == u);
+      Arc arc = _graph->addArc(u, v);
+      _direction->set(arc, _graph->source(arc) == u);
       return arc;
     }
@@ -2522 +2344 @@
   /// \ingroup graph_adaptors
   ///
-  /// \brief Adaptor class for orienting the edges of a graph to get a digraph
-  ///
-  /// Orienter adaptor can be used for orienting the edges of a graph to
-  /// get a digraph. A \c bool edge map of the underlying graph must be
-  /// specified, which define the direction of the arcs in the adaptor.
-  /// The arcs can be easily reversed by the \c reverseArc() member function
-  /// of the adaptor.
-  /// This class conforms to the \ref concepts::Digraph "Digraph" concept.
-  ///
-  /// The adapted graph can also be modified through this adaptor
-  /// by adding or removing nodes or arcs, unless the \c GR template
-  /// parameter is set to be \c const.
-  ///
-  /// \tparam GR The type of the adapted graph.
-  /// It must conform to the \ref concepts::Graph "Graph" concept.
-  /// It can also be specified to be \c const.
-  /// \tparam DM The type of the direction map.
-  /// It must be a \c bool (or convertible) edge map of the
-  /// adapted graph. The default type is
-  /// \ref concepts::Graph::EdgeMap "GR::EdgeMap<bool>".
-  ///
-  /// \note The \c Node type of this adaptor and the adapted graph are
-  /// convertible to each other, moreover the \c Arc type of the adaptor
-  /// and the \c Edge type of the adapted graph are also convertible to
-  /// each other.
-#ifdef DOXYGEN
-  template<typename GR,
-           typename DM>
-  class Orienter {
-#else
-  template<typename GR,
-           typename DM = typename GR::template EdgeMap<bool> >
+  /// \brief Orients the edges of the graph to get a digraph
+  ///
+  /// This adaptor orients each edge in the undirected graph. The
+  /// direction of the arcs stored in an edge node map.  The arcs can
+  /// be easily reverted by the \c reverseArc() member function in the
+  /// adaptor. The Orienter adaptor is conform to the \ref
+  /// concepts::Digraph "Digraph concept".
+  ///
+  /// \tparam _Graph It must be conform to the \ref concepts::Graph
+  /// "Graph concept". The type can be specified to be const.
+  /// \tparam _DirectionMap A bool valued edge map of the the adapted
+  /// graph.
+  ///
+  /// \sa orienter
+  template<typename _Graph,
+           typename DirectionMap = typename _Graph::template EdgeMap<bool> >
   class Orienter :
-    public DigraphAdaptorExtender<OrienterBase<GR, DM> > {
-#endif
-  public:
-
-    /// The type of the adapted graph.
-    typedef GR Graph;
-    /// The type of the direction edge map.
-    typedef DM DirectionMap;
-
-    typedef DigraphAdaptorExtender<OrienterBase<GR, DM> > Parent;
+    public DigraphAdaptorExtender<OrienterBase<_Graph, DirectionMap> > {
+  public:
+    typedef _Graph Graph;
+    typedef DigraphAdaptorExtender<
+      OrienterBase<_Graph, DirectionMap> > Parent;
     typedef typename Parent::Arc Arc;
   protected:
@@ -2570 +2371 @@
   public:
 
-    /// \brief Constructor
-    ///
-    /// Constructor of the adaptor.
+    /// \brief Constructor of the adaptor
+    ///
+    /// Constructor of the adaptor
     Orienter(Graph& graph, DirectionMap& direction) {
       setGraph(graph);
@@ -2578 +2379 @@
     }
 
-    /// \brief Reverses the given arc
-    ///
-    /// This function reverses the given arc.
-    /// It is done by simply negate the assigned value of \c a
-    /// in the direction map.
+    /// \brief Reverse arc
+    ///
+    /// It reverse the given arc. It simply negate the direction in the map.
     void reverseArc(const Arc& a) {
       Parent::reverseArc(a);
@@ -2588 +2387 @@
   };
 
-  /// \brief Returns a read-only Orienter adaptor
-  ///
-  /// This function just returns a read-only \ref Orienter adaptor.
-  /// \ingroup graph_adaptors
-  /// \relates Orienter
-  template<typename GR, typename DM>
-  Orienter<const GR, DM>
-  orienter(const GR& graph, DM& direction_map) {
-    return Orienter<const GR, DM>(graph, direction_map);
+  /// \brief Just gives back a Orienter
+  ///
+  /// Just gives back a Orienter
+  template<typename Graph, typename DirectionMap>
+  Orienter<const Graph, DirectionMap>
+  orienter(const Graph& graph, DirectionMap& dm) {
+    return Orienter<const Graph, DirectionMap>(graph, dm);
   }
 
-  template<typename GR, typename DM>
-  Orienter<const GR, const DM>
-  orienter(const GR& graph, const DM& direction_map) {
-    return Orienter<const GR, const DM>(graph, direction_map);
+  template<typename Graph, typename DirectionMap>
+  Orienter<const Graph, const DirectionMap>
+  orienter(const Graph& graph, const DirectionMap& dm) {
+    return Orienter<const Graph, const DirectionMap>(graph, dm);
   }
 
   namespace _adaptor_bits {
 
-    template<typename Digraph,
-             typename CapacityMap,
-             typename FlowMap,
-             typename Tolerance>
+    template<typename _Digraph,
+             typename _CapacityMap = typename _Digraph::template ArcMap<int>,
+             typename _FlowMap = _CapacityMap,
+             typename _Tolerance = Tolerance<typename _CapacityMap::Value> >
     class ResForwardFilter {
     public:
+
+      typedef _Digraph Digraph;
+      typedef _CapacityMap CapacityMap;
+      typedef _FlowMap FlowMap;
+      typedef _Tolerance Tolerance;
 
       typedef typename Digraph::Arc Key;
@@ -2633 +2435 @@
     };
 
-    template<typename Digraph,
-             typename CapacityMap,
-             typename FlowMap,
-             typename Tolerance>
+    template<typename _Digraph,
+             typename _CapacityMap = typename _Digraph::template ArcMap<int>,
+             typename _FlowMap = _CapacityMap,
+             typename _Tolerance = Tolerance<typename _CapacityMap::Value> >
     class ResBackwardFilter {
     public:
+
+      typedef _Digraph Digraph;
+      typedef _CapacityMap CapacityMap;
+      typedef _FlowMap FlowMap;
+      typedef _Tolerance Tolerance;
 
       typedef typename Digraph::Arc Key;
@@ -2664 +2471 @@
   /// \ingroup graph_adaptors
   ///
-  /// \brief Adaptor class for composing the residual digraph for directed
+  /// \brief An adaptor for composing the residual graph for directed
   /// flow and circulation problems.
   ///
-  /// Residual can be used for composing the \e residual digraph for directed
-  /// flow and circulation problems. Let \f$ G=(V, A) \f$ be a directed graph
-  /// and let \f$ F \f$ be a number type. Let \f$ flow, cap: A\to F \f$ be
-  /// functions on the arcs.
-  /// This adaptor implements a digraph structure with node set \f$ V \f$
-  /// and arc set \f$ A_{forward}\cup A_{backward} \f$,
-  /// where \f$ A_{forward}=\{uv : uv\in A, flow(uv)<cap(uv)\} \f$ and
-  /// \f$ A_{backward}=\{vu : uv\in A, flow(uv)>0\} \f$, i.e. the so
-  /// called residual digraph.
-  /// When the union \f$ A_{forward}\cup A_{backward} \f$ is taken,
-  /// multiplicities are counted, i.e. the adaptor has exactly
-  /// \f$ |A_{forward}| + |A_{backward}|\f$ arcs (it may have parallel
-  /// arcs).
-  /// This class conforms to the \ref concepts::Digraph "Digraph" concept.
-  ///
-  /// \tparam GR The type of the adapted digraph.
-  /// It must conform to the \ref concepts::Digraph "Digraph" concept.
-  /// It is implicitly \c const.
-  /// \tparam CM The type of the capacity map.
-  /// It must be an arc map of some numerical type, which defines
-  /// the capacities in the flow problem. It is implicitly \c const.
-  /// The default type is
-  /// \ref concepts::Digraph::ArcMap "GR::ArcMap<int>".
-  /// \tparam FM The type of the flow map.
-  /// It must be an arc map of some numerical type, which defines
-  /// the flow values in the flow problem. The default type is \c CM.
-  /// \tparam TL The tolerance type for handling inexact computation.
-  /// The default tolerance type depends on the value type of the
-  /// capacity map.
-  ///
-  /// \note This adaptor is implemented using Undirector and FilterArcs
-  /// adaptors.
-  ///
-  /// \note The \c Node type of this adaptor and the adapted digraph are
-  /// convertible to each other, moreover the \c Arc type of the adaptor
-  /// is convertible to the \c Arc type of the adapted digraph.
-#ifdef DOXYGEN
-  template<typename GR, typename CM, typename FM, typename TL>
-  class Residual
-#else
-  template<typename GR,
-           typename CM = typename GR::template ArcMap<int>,
-           typename FM = CM,
-           typename TL = Tolerance<typename CM::Value> >
+  /// An adaptor for composing the residual graph for directed flow and
+  /// circulation problems.  Let \f$ G=(V, A) \f$ be a directed graph
+  /// and let \f$ F \f$ be a number type. Let moreover \f$ f,c:A\to F \f$,
+  /// be functions on the arc-set.
+  ///
+  /// Then Residual implements the digraph structure with
+  /// node-set \f$ V \f$ and arc-set \f$ A_{forward}\cup A_{backward} \f$,
+  /// where \f$ A_{forward}=\{uv : uv\in A, f(uv)<c(uv)\} \f$ and
+  /// \f$ A_{backward}=\{vu : uv\in A, f(uv)>0\} \f$, i.e. the so
+  /// called residual graph.  When we take the union
+  /// \f$ A_{forward}\cup A_{backward} \f$, multiplicities are counted,
+  /// i.e.  if an arc is in both \f$ A_{forward} \f$ and
+  /// \f$ A_{backward} \f$, then in the adaptor it appears in both
+  /// orientation.
+  ///
+  /// \tparam _Digraph It must be conform to the \ref concepts::Digraph
+  /// "Digraph concept". The type is implicitly const.
+  /// \tparam _CapacityMap An arc map of some numeric type, it defines
+  /// the capacities in the flow problem. The map is implicitly const.
+  /// \tparam _FlowMap An arc map of some numeric type, it defines
+  /// the capacities in the flow problem.
+  /// \tparam _Tolerance Handler for inexact computation.
+  template<typename _Digraph,
+           typename _CapacityMap = typename _Digraph::template ArcMap<int>,
+           typename _FlowMap = _CapacityMap,
+           typename _Tolerance = Tolerance<typename _CapacityMap::Value> >
   class Residual :
     public FilterArcs<
-      Undirector<const GR>,
-      typename Undirector<const GR>::template CombinedArcMap<
-        _adaptor_bits::ResForwardFilter<const GR, CM, FM, TL>,
-        _adaptor_bits::ResBackwardFilter<const GR, CM, FM, TL> > >
-#endif
+    Undirector<const _Digraph>,
+    typename Undirector<const _Digraph>::template CombinedArcMap<
+      _adaptor_bits::ResForwardFilter<const _Digraph, _CapacityMap,
+                                      _FlowMap, _Tolerance>,
+      _adaptor_bits::ResBackwardFilter<const _Digraph, _CapacityMap,
+                                       _FlowMap, _Tolerance> > >
   {
   public:
 
-    /// The type of the underlying digraph.
-    typedef GR Digraph;
-    /// The type of the capacity map.
-    typedef CM CapacityMap;
-    /// The type of the flow map.
-    typedef FM FlowMap;
-    /// The tolerance type.
-    typedef TL Tolerance;
+    typedef _Digraph Digraph;
+    typedef _CapacityMap CapacityMap;
+    typedef _FlowMap FlowMap;
+    typedef _Tolerance Tolerance;
 
     typedef typename CapacityMap::Value Value;
@@ -2744 +2530 @@
 
     typedef typename Undirected::
-      template CombinedArcMap<ForwardFilter, BackwardFilter> ArcFilter;
+    template CombinedArcMap<ForwardFilter, BackwardFilter> ArcFilter;
 
     typedef FilterArcs<Undirected, ArcFilter> Parent;
@@ -2758 +2544 @@
   public:
 
-    /// \brief Constructor
-    ///
-    /// Constructor of the residual digraph adaptor. The parameters are the
-    /// digraph, the capacity map, the flow map, and a tolerance object.
+    /// \brief Constructor of the residual digraph.
+    ///
+    /// Constructor of the residual graph. The parameters are the digraph,
+    /// the flow map, the capacity map and a tolerance object.
     Residual(const Digraph& digraph, const CapacityMap& capacity,
              FlowMap& flow, const Tolerance& tolerance = Tolerance())
@@ -2775 +2561 @@
     typedef typename Parent::Arc Arc;
 
-    /// \brief Returns the residual capacity of the given arc.
-    ///
-    /// Returns the residual capacity of the given arc.
+    /// \brief Gives back the residual capacity of the arc.
+    ///
+    /// Gives back the residual capacity of the arc.
     Value residualCapacity(const Arc& a) const {
       if (Undirected::direction(a)) {
@@ -2786 +2572 @@
     }
 
-    /// \brief Augments on the given arc in the residual digraph.
-    ///
-    /// Augments on the given arc in the residual digraph. It increases
-    /// or decreases the flow value on the original arc according to the
-    /// direction of the residual arc.
+    /// \brief Augment on the given arc in the residual graph.
+    ///
+    /// Augment on the given arc in the residual graph. It increase
+    /// or decrease the flow on the original arc depend on the direction
+    /// of the residual arc.
     void augment(const Arc& a, const Value& v) const {
       if (Undirected::direction(a)) {
@@ -2799 +2585 @@
     }
 
-    /// \brief Returns \c true if the given residual arc is a forward arc.
-    ///
-    /// Returns \c true if the given residual arc has the same orientation
-    /// as the original arc, i.e. it is a so called forward arc.
+    /// \brief Returns the direction of the arc.
+    ///
+    /// Returns true when the arc is same oriented as the original arc.
     static bool forward(const Arc& a) {
       return Undirected::direction(a);
     }
 
-    /// \brief Returns \c true if the given residual arc is a backward arc.
-    ///
-    /// Returns \c true if the given residual arc has the opposite orientation
-    /// than the original arc, i.e. it is a so called backward arc.
+    /// \brief Returns the direction of the arc.
+    ///
+    /// Returns true when the arc is opposite oriented as the original arc.
     static bool backward(const Arc& a) {
       return !Undirected::direction(a);
     }
 
-    /// \brief Returns the forward oriented residual arc.
-    ///
-    /// Returns the forward oriented residual arc related to the given
-    /// arc of the underlying digraph.
+    /// \brief Gives back the forward oriented residual arc.
+    ///
+    /// Gives back the forward oriented residual arc.
     static Arc forward(const typename Digraph::Arc& a) {
       return Undirected::direct(a, true);
     }
 
-    /// \brief Returns the backward oriented residual arc.
-    ///
-    /// Returns the backward oriented residual arc related to the given
-    /// arc of the underlying digraph.
+    /// \brief Gives back the backward oriented residual arc.
+    ///
+    /// Gives back the backward oriented residual arc.
     static Arc backward(const typename Digraph::Arc& a) {
       return Undirected::direct(a, false);
@@ -2833 +2615 @@
     /// \brief Residual capacity map.
     ///
-    /// This map adaptor class can be used for obtaining the residual
-    /// capacities as an arc map of the residual digraph.
-    /// Its value type is inherited from the capacity map.
+    /// In generic residual graph the residual capacity can be obtained
+    /// as a map.
     class ResidualCapacity {
     protected:
       const Adaptor* _adaptor;
     public:
-      /// The key type of the map
+      /// The Key type
       typedef Arc Key;
-      /// The value type of the map
-      typedef typename CapacityMap::Value Value;
+      /// The Value type
+      typedef typename _CapacityMap::Value Value;
 
       /// Constructor
       ResidualCapacity(const Adaptor& adaptor) : _adaptor(&adaptor) {}
 
-      /// Returns the value associated with the given residual arc
+      /// \e
       Value operator[](const Arc& a) const {
         return _adaptor->residualCapacity(a);
@@ -2855 +2636 @@
     };
 
-    /// \brief Returns a residual capacity map
-    ///
-    /// This function just returns a residual capacity map.
-    ResidualCapacity residualCapacity() const {
-      return ResidualCapacity(*this);
-    }
-
   };
-
-  /// \brief Returns a (read-only) Residual adaptor
-  ///
-  /// This function just returns a (read-only) \ref Residual adaptor.
-  /// \ingroup graph_adaptors
-  /// \relates Residual
-  template<typename GR, typename CM, typename FM>
-  Residual<GR, CM, FM> residual(const GR& digraph,
-                                const CM& capacity_map,
-                                FM& flow_map) {
-    return Residual<GR, CM, FM> (digraph, capacity_map, flow_map);
-  }
-
 
   template <typename _Digraph>
@@ -3124 +2885 @@
 
     typedef True NodeNumTag;
+
     int nodeNum() const {
       return  2 * countNodes(*_digraph);
     }
 
-    typedef True ArcNumTag;
+    typedef True EdgeNumTag;
     int arcNum() const {
       return countArcs(*_digraph) + countNodes(*_digraph);
     }
 
-    typedef True FindArcTag;
+    typedef True FindEdgeTag;
     Arc findArc(const Node& u, const Node& v,
                 const Arc& prev = INVALID) const {
-      if (inNode(u) && outNode(v)) {
-        if (static_cast<const DigraphNode&>(u) ==
-            static_cast<const DigraphNode&>(v) && prev == INVALID) {
-          return Arc(u);
+      if (inNode(u)) {
+        if (outNode(v)) {
+          if (static_cast<const DigraphNode&>(u) ==
+              static_cast<const DigraphNode&>(v) && prev == INVALID) {
+            return Arc(u);
+          }
         }
-      }
-      else if (outNode(u) && inNode(v)) {
-        return Arc(::lemon::findArc(*_digraph, u, v, prev));
+      } else {
+        if (inNode(v)) {
+          return Arc(::lemon::findArc(*_digraph, u, v, prev));
+        }
       }
       return INVALID;
@@ -3157 +2922 @@
       typedef Node Key;
       typedef _Value Value;
-      typedef typename MapTraits<NodeImpl>::ReferenceMapTag ReferenceMapTag;
-      typedef typename MapTraits<NodeImpl>::ReturnValue ReturnValue;
-      typedef typename MapTraits<NodeImpl>::ConstReturnValue ConstReturnValue;
-      typedef typename MapTraits<NodeImpl>::ReturnValue Reference;
-      typedef typename MapTraits<NodeImpl>::ConstReturnValue ConstReference;
 
       NodeMapBase(const Adaptor& adaptor)
@@ -3174 +2934 @@
       }
 
-      ReturnValue operator[](const Node& key) {
+      typename MapTraits<NodeImpl>::ReturnValue
+      operator[](const Node& key) {
         if (Adaptor::inNode(key)) { return _in_map[key]; }
         else { return _out_map[key]; }
       }
 
-      ConstReturnValue operator[](const Node& key) const {
+      typename MapTraits<NodeImpl>::ConstReturnValue
+      operator[](const Node& key) const {
         if (Adaptor::inNode(key)) { return _in_map[key]; }
         else { return _out_map[key]; }
@@ -3196 +2958 @@
       typedef Arc Key;
       typedef _Value Value;
-      typedef typename MapTraits<ArcImpl>::ReferenceMapTag ReferenceMapTag;
-      typedef typename MapTraits<ArcImpl>::ReturnValue ReturnValue;
-      typedef typename MapTraits<ArcImpl>::ConstReturnValue ConstReturnValue;
-      typedef typename MapTraits<ArcImpl>::ReturnValue Reference;
-      typedef typename MapTraits<ArcImpl>::ConstReturnValue ConstReference;
 
       ArcMapBase(const Adaptor& adaptor)
@@ -3216 +2973 @@
       }
 
-      ReturnValue operator[](const Arc& key) {
+      typename MapTraits<ArcImpl>::ReturnValue
+      operator[](const Arc& key) {
         if (Adaptor::origArc(key)) {
           return _arc_map[key._item.first()];
@@ -3224 +2982 @@
       }
 
-      ConstReturnValue operator[](const Arc& key) const {
+      typename MapTraits<ArcImpl>::ConstReturnValue
+      operator[](const Arc& key) const {
         if (Adaptor::origArc(key)) {
           return _arc_map[key._item.first()];
@@ -3305 +3064 @@
   /// \ingroup graph_adaptors
   ///
-  /// \brief Adaptor class for splitting the nodes of a digraph.
-  ///
-  /// SplitNodes adaptor can be used for splitting each node into an
-  /// \e in-node and an \e out-node in a digraph. Formaly, the adaptor
-  /// replaces each node \f$ u \f$ in the digraph with two nodes,
-  /// namely node \f$ u_{in} \f$ and node \f$ u_{out} \f$.
-  /// If there is a \f$ (v, u) \f$ arc in the original digraph, then the
-  /// new target of the arc will be \f$ u_{in} \f$ and similarly the
-  /// source of each original \f$ (u, v) \f$ arc will be \f$ u_{out} \f$.
-  /// The adaptor adds an additional \e bind \e arc from \f$ u_{in} \f$
-  /// to \f$ u_{out} \f$ for each node \f$ u \f$ of the original digraph.
-  ///
-  /// The aim of this class is running an algorithm with respect to node
-  /// costs or capacities if the algorithm considers only arc costs or
-  /// capacities directly.
-  /// In this case you can use \c SplitNodes adaptor, and set the node
-  /// costs/capacities of the original digraph to the \e bind \e arcs
-  /// in the adaptor.
-  ///
-  /// \tparam GR The type of the adapted digraph.
-  /// It must conform to the \ref concepts::Digraph "Digraph" concept.
-  /// It is implicitly \c const.
-  ///
-  /// \note The \c Node type of this adaptor is converible to the \c Node
-  /// type of the adapted digraph.
-  template <typename GR>
-#ifdef DOXYGEN
-  class SplitNodes {
-#else
+  /// \brief Split the nodes of a directed graph
+  ///
+  /// The SplitNodes adaptor splits each node into an in-node and an
+  /// out-node. Formaly, the adaptor replaces each \f$ u \f$ node in
+  /// the digraph with two nodes(namely node \f$ u_{in} \f$ and node
+  /// \f$ u_{out} \f$). If there is a \f$ (v, u) \f$ arc in the
+  /// original digraph the new target of the arc will be \f$ u_{in} \f$
+  /// and similarly the source of the original \f$ (u, v) \f$ arc
+  /// will be \f$ u_{out} \f$.  The adaptor will add for each node in
+  /// the original digraph an additional arc which connects
+  /// \f$ (u_{in}, u_{out}) \f$.
+  ///
+  /// The aim of this class is to run algorithm with node costs if the
+  /// algorithm can use directly just arc costs. In this case we should use
+  /// a \c SplitNodes and set the node cost of the graph to the
+  /// bind arc in the adapted graph.
+  ///
+  /// \tparam _Digraph It must be conform to the \ref concepts::Digraph
+  /// "Digraph concept". The type can be specified to be const.
+  template <typename _Digraph>
   class SplitNodes
-    : public DigraphAdaptorExtender<SplitNodesBase<const GR> > {
-#endif
-  public:
-    typedef GR Digraph;
-    typedef DigraphAdaptorExtender<SplitNodesBase<const GR> > Parent;
+    : public DigraphAdaptorExtender<SplitNodesBase<_Digraph> > {
+  public:
+    typedef _Digraph Digraph;
+    typedef DigraphAdaptorExtender<SplitNodesBase<Digraph> > Parent;
 
     typedef typename Digraph::Node DigraphNode;
@@ -3347 +3096 @@
     typedef typename Parent::Arc Arc;
 
-    /// \brief Constructor
+    /// \brief Constructor of the adaptor.
     ///
     /// Constructor of the adaptor.
-    SplitNodes(const Digraph& g) {
+    SplitNodes(Digraph& g) {
       Parent::setDigraph(g);
     }
 
-    /// \brief Returns \c true if the given node is an in-node.
-    ///
-    /// Returns \c true if the given node is an in-node.
+    /// \brief Returns true when the node is in-node.
+    ///
+    /// Returns true when the node is in-node.
     static bool inNode(const Node& n) {
       return Parent::inNode(n);
     }
 
-    /// \brief Returns \c true if the given node is an out-node.
-    ///
-    /// Returns \c true if the given node is an out-node.
+    /// \brief Returns true when the node is out-node.
+    ///
+    /// Returns true when the node is out-node.
     static bool outNode(const Node& n) {
       return Parent::outNode(n);
     }
 
-    /// \brief Returns \c true if the given arc is an original arc.
-    ///
-    /// Returns \c true if the given arc is one of the arcs in the
-    /// original digraph.
+    /// \brief Returns true when the arc is arc in the original digraph.
+    ///
+    /// Returns true when the arc is arc in the original digraph.
     static bool origArc(const Arc& a) {
       return Parent::origArc(a);
     }
 
-    /// \brief Returns \c true if the given arc is a bind arc.
-    ///
-    /// Returns \c true if the given arc is a bind arc, i.e. it connects
-    /// an in-node and an out-node.
+    /// \brief Returns true when the arc binds an in-node and an out-node.
+    ///
+    /// Returns true when the arc binds an in-node and an out-node.
     static bool bindArc(const Arc& a) {
       return Parent::bindArc(a);
     }
 
-    /// \brief Returns the in-node created from the given original node.
-    ///
-    /// Returns the in-node created from the given original node.
+    /// \brief Gives back the in-node created from the \c node.
+    ///
+    /// Gives back the in-node created from the \c node.
     static Node inNode(const DigraphNode& n) {
       return Parent::inNode(n);
     }
 
-    /// \brief Returns the out-node created from the given original node.
-    ///
-    /// Returns the out-node created from the given original node.
+    /// \brief Gives back the out-node created from the \c node.
+    ///
+    /// Gives back the out-node created from the \c node.
     static Node outNode(const DigraphNode& n) {
       return Parent::outNode(n);
     }
 
-    /// \brief Returns the bind arc that corresponds to the given
-    /// original node.
-    ///
-    /// Returns the bind arc in the adaptor that corresponds to the given
-    /// original node, i.e. the arc connecting the in-node and out-node
-    /// of \c n.
+    /// \brief Gives back the arc binds the two part of the node.
+    ///
+    /// Gives back the arc binds the two part of the node.
     static Arc arc(const DigraphNode& n) {
       return Parent::arc(n);
     }
 
-    /// \brief Returns the arc that corresponds to the given original arc.
-    ///
-    /// Returns the arc in the adaptor that corresponds to the given
-    /// original arc.
+    /// \brief Gives back the arc of the original arc.
+    ///
+    /// Gives back the arc of the original arc.
     static Arc arc(const DigraphArc& a) {
       return Parent::arc(a);
     }
 
-    /// \brief Node map combined from two original node maps
-    ///
-    /// This map adaptor class adapts two node maps of the original digraph
-    /// to get a node map of the split digraph.
-    /// Its value type is inherited from the first node map type
-    /// (\c InNodeMap).
+    /// \brief NodeMap combined from two original NodeMap
+    ///
+    /// This class adapt two of the original digraph NodeMap to
+    /// get a node map on the adapted digraph.
     template <typename InNodeMap, typename OutNodeMap>
     class CombinedNodeMap {
     public:
 
-      /// The key type of the map
       typedef Node Key;
-      /// The value type of the map
       typedef typename InNodeMap::Value Value;
 
-      typedef typename MapTraits<InNodeMap>::ReferenceMapTag ReferenceMapTag;
-      typedef typename MapTraits<InNodeMap>::ReturnValue ReturnValue;
-      typedef typename MapTraits<InNodeMap>::ConstReturnValue ConstReturnValue;
-      typedef typename MapTraits<InNodeMap>::ReturnValue Reference;
-      typedef typename MapTraits<InNodeMap>::ConstReturnValue ConstReference;
-
-      /// Constructor
+      /// \brief Constructor
+      ///
+      /// Constructor.
       CombinedNodeMap(InNodeMap& in_map, OutNodeMap& out_map)
         : _in_map(in_map), _out_map(out_map) {}
 
-      /// Returns the value associated with the given key.
+      /// \brief The subscript operator.
+      ///
+      /// The subscript operator.
+      Value& operator[](const Key& key) {
+        if (Parent::inNode(key)) {
+          return _in_map[key];
+        } else {
+          return _out_map[key];
+        }
+      }
+
+      /// \brief The const subscript operator.
+      ///
+      /// The const subscript operator.
       Value operator[](const Key& key) const {
         if (Parent::inNode(key)) {
@@ -3450 +3198 @@
       }
 
-      /// Returns a reference to the value associated with the given key.
-      Value& operator[](const Key& key) {
-        if (Parent::inNode(key)) {
-          return _in_map[key];
-        } else {
-          return _out_map[key];
-        }
-      }
-
-      /// Sets the value associated with the given key.
+      /// \brief The setter function of the map.
+      ///
+      /// The setter function of the map.
       void set(const Key& key, const Value& value) {
         if (Parent::inNode(key)) {
@@ -3476 +3217 @@
 
 
-    /// \brief Returns a combined node map
-    ///
-    /// This function just returns a combined node map.
+    /// \brief Just gives back a combined node map
+    ///
+    /// Just gives back a combined node map
     template <typename InNodeMap, typename OutNodeMap>
     static CombinedNodeMap<InNodeMap, OutNodeMap>
@@ -3504 +3245 @@
     }
 
-    /// \brief Arc map combined from an arc map and a node map of the
-    /// original digraph.
-    ///
-    /// This map adaptor class adapts an arc map and a node map of the
-    /// original digraph to get an arc map of the split digraph.
-    /// Its value type is inherited from the original arc map type
-    /// (\c ArcMap).
-    template <typename ArcMap, typename NodeMap>
+    /// \brief ArcMap combined from an original ArcMap and a NodeMap
+    ///
+    /// This class adapt an original ArcMap and a NodeMap to get an
+    /// arc map on the adapted digraph
+    template <typename DigraphArcMap, typename DigraphNodeMap>
     class CombinedArcMap {
     public:
 
-      /// The key type of the map
       typedef Arc Key;
-      /// The value type of the map
-      typedef typename ArcMap::Value Value;
-
-      typedef typename MapTraits<ArcMap>::ReferenceMapTag ReferenceMapTag;
-      typedef typename MapTraits<ArcMap>::ReturnValue ReturnValue;
-      typedef typename MapTraits<ArcMap>::ConstReturnValue ConstReturnValue;
-      typedef typename MapTraits<ArcMap>::ReturnValue Reference;
-      typedef typename MapTraits<ArcMap>::ConstReturnValue ConstReference;
-
-      /// Constructor
-      CombinedArcMap(ArcMap& arc_map, NodeMap& node_map)
+      typedef typename DigraphArcMap::Value Value;
+
+      /// \brief Constructor
+      ///
+      /// Constructor.
+      CombinedArcMap(DigraphArcMap& arc_map, DigraphNodeMap& node_map)
         : _arc_map(arc_map), _node_map(node_map) {}
 
-      /// Returns the value associated with the given key.
+      /// \brief The subscript operator.
+      ///
+      /// The subscript operator.
+      void set(const Arc& arc, const Value& val) {
+        if (Parent::origArc(arc)) {
+          _arc_map.set(arc, val);
+        } else {
+          _node_map.set(arc, val);
+        }
+      }
+
+      /// \brief The const subscript operator.
+      ///
+      /// The const subscript operator.
       Value operator[](const Key& arc) const {
         if (Parent::origArc(arc)) {
@@ -3539 +3284 @@
       }
 
-      /// Returns a reference to the value associated with the given key.
+      /// \brief The const subscript operator.
+      ///
+      /// The const subscript operator.
       Value& operator[](const Key& arc) {
         if (Parent::origArc(arc)) {
@@ -3548 +3295 @@
       }
 
-      /// Sets the value associated with the given key.
-      void set(const Arc& arc, const Value& val) {
-        if (Parent::origArc(arc)) {
-          _arc_map.set(arc, val);
-        } else {
-          _node_map.set(arc, val);
-        }
-      }
-
     private:
-      ArcMap& _arc_map;
-      NodeMap& _node_map;
+      DigraphArcMap& _arc_map;
+      DigraphNodeMap& _node_map;
     };
 
-    /// \brief Returns a combined arc map
-    ///
-    /// This function just returns a combined arc map.
-    template <typename ArcMap, typename NodeMap>
-    static CombinedArcMap<ArcMap, NodeMap>
-    combinedArcMap(ArcMap& arc_map, NodeMap& node_map) {
-      return CombinedArcMap<ArcMap, NodeMap>(arc_map, node_map);
-    }
-
-    template <typename ArcMap, typename NodeMap>
-    static CombinedArcMap<const ArcMap, NodeMap>
-    combinedArcMap(const ArcMap& arc_map, NodeMap& node_map) {
-      return CombinedArcMap<const ArcMap, NodeMap>(arc_map, node_map);
-    }
-
-    template <typename ArcMap, typename NodeMap>
-    static CombinedArcMap<ArcMap, const NodeMap>
-    combinedArcMap(ArcMap& arc_map, const NodeMap& node_map) {
-      return CombinedArcMap<ArcMap, const NodeMap>(arc_map, node_map);
-    }
-
-    template <typename ArcMap, typename NodeMap>
-    static CombinedArcMap<const ArcMap, const NodeMap>
-    combinedArcMap(const ArcMap& arc_map, const NodeMap& node_map) {
-      return CombinedArcMap<const ArcMap, const NodeMap>(arc_map, node_map);
+    /// \brief Just gives back a combined arc map
+    ///
+    /// Just gives back a combined arc map
+    template <typename DigraphArcMap, typename DigraphNodeMap>
+    static CombinedArcMap<DigraphArcMap, DigraphNodeMap>
+    combinedArcMap(DigraphArcMap& arc_map, DigraphNodeMap& node_map) {
+      return CombinedArcMap<DigraphArcMap, DigraphNodeMap>(arc_map, node_map);
+    }
+
+    template <typename DigraphArcMap, typename DigraphNodeMap>
+    static CombinedArcMap<const DigraphArcMap, DigraphNodeMap>
+    combinedArcMap(const DigraphArcMap& arc_map, DigraphNodeMap& node_map) {
+      return CombinedArcMap<const DigraphArcMap,
+        DigraphNodeMap>(arc_map, node_map);
+    }
+
+    template <typename DigraphArcMap, typename DigraphNodeMap>
+    static CombinedArcMap<DigraphArcMap, const DigraphNodeMap>
+    combinedArcMap(DigraphArcMap& arc_map, const DigraphNodeMap& node_map) {
+      return CombinedArcMap<DigraphArcMap,
+        const DigraphNodeMap>(arc_map, node_map);
+    }
+
+    template <typename DigraphArcMap, typename DigraphNodeMap>
+    static CombinedArcMap<const DigraphArcMap, const DigraphNodeMap>
+    combinedArcMap(const DigraphArcMap& arc_map,
+                   const DigraphNodeMap& node_map) {
+      return CombinedArcMap<const DigraphArcMap,
+        const DigraphNodeMap>(arc_map, node_map);
     }
 
   };
 
-  /// \brief Returns a (read-only) SplitNodes adaptor
-  ///
-  /// This function just returns a (read-only) \ref SplitNodes adaptor.
-  /// \ingroup graph_adaptors
-  /// \relates SplitNodes
-  template<typename GR>
-  SplitNodes<GR>
-  splitNodes(const GR& digraph) {
-    return SplitNodes<GR>(digraph);
+  /// \brief Just gives back a node splitter
+  ///
+  /// Just gives back a node splitter
+  template<typename Digraph>
+  SplitNodes<Digraph>
+  splitNodes(const Digraph& digraph) {
+    return SplitNodes<Digraph>(digraph);
   }
 
+
 } //namespace lemon
 

lemon/bits/graph_adaptor_extender.h

@@ -174 +174 @@
   };
 
+
+  /// \ingroup digraphbits
+  ///
+  /// \brief Extender for the GraphAdaptors
   template <typename _Graph>
   class GraphAdaptorExtender : public _Graph {