deba@432: /* -*- mode: C++; indent-tabs-mode: nil; -*-
deba@430:  *
deba@432:  * This file is a part of LEMON, a generic C++ optimization library.
deba@430:  *
alpar@477:  * Copyright (C) 2003-2009
deba@430:  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
deba@430:  * (Egervary Research Group on Combinatorial Optimization, EGRES).
deba@430:  *
deba@430:  * Permission to use, modify and distribute this software is granted
deba@430:  * provided that this copyright notice appears in all copies. For
deba@430:  * precise terms see the accompanying LICENSE file.
deba@430:  *
deba@430:  * This software is provided "AS IS" with no warranty of any kind,
deba@430:  * express or implied, and with no claim as to its suitability for any
deba@430:  * purpose.
deba@430:  *
deba@430:  */
deba@430: 
deba@432: #ifndef LEMON_ADAPTORS_H
deba@432: #define LEMON_ADAPTORS_H
deba@432: 
deba@432: /// \ingroup graph_adaptors
deba@432: /// \file
kpeter@474: /// \brief Adaptor classes for digraphs and graphs
deba@430: ///
deba@432: /// This file contains several useful adaptors for digraphs and graphs.
deba@430: 
deba@430: #include <lemon/core.h>
deba@430: #include <lemon/maps.h>
deba@430: #include <lemon/bits/variant.h>
deba@430: 
deba@430: #include <lemon/bits/graph_adaptor_extender.h>
deba@430: #include <lemon/tolerance.h>
deba@430: 
deba@430: #include <algorithm>
deba@430: 
deba@430: namespace lemon {
deba@430: 
deba@430:   template<typename _Digraph>
deba@430:   class DigraphAdaptorBase {
deba@430:   public:
deba@430:     typedef _Digraph Digraph;
deba@430:     typedef DigraphAdaptorBase Adaptor;
deba@430:     typedef Digraph ParentDigraph;
deba@430: 
deba@430:   protected:
deba@430:     Digraph* _digraph;
deba@430:     DigraphAdaptorBase() : _digraph(0) { }
deba@430:     void setDigraph(Digraph& digraph) { _digraph = &digraph; }
deba@430: 
deba@430:   public:
deba@430:     DigraphAdaptorBase(Digraph& digraph) : _digraph(&digraph) { }
deba@430: 
deba@430:     typedef typename Digraph::Node Node;
deba@430:     typedef typename Digraph::Arc Arc;
deba@432: 
deba@430:     void first(Node& i) const { _digraph->first(i); }
deba@430:     void first(Arc& i) const { _digraph->first(i); }
deba@430:     void firstIn(Arc& i, const Node& n) const { _digraph->firstIn(i, n); }
deba@430:     void firstOut(Arc& i, const Node& n ) const { _digraph->firstOut(i, n); }
deba@430: 
deba@430:     void next(Node& i) const { _digraph->next(i); }
deba@430:     void next(Arc& i) const { _digraph->next(i); }
deba@430:     void nextIn(Arc& i) const { _digraph->nextIn(i); }
deba@430:     void nextOut(Arc& i) const { _digraph->nextOut(i); }
deba@430: 
deba@430:     Node source(const Arc& a) const { return _digraph->source(a); }
deba@430:     Node target(const Arc& a) const { return _digraph->target(a); }
deba@430: 
deba@430:     typedef NodeNumTagIndicator<Digraph> NodeNumTag;
deba@430:     int nodeNum() const { return _digraph->nodeNum(); }
deba@432: 
kpeter@469:     typedef ArcNumTagIndicator<Digraph> ArcNumTag;
deba@430:     int arcNum() const { return _digraph->arcNum(); }
deba@430: 
kpeter@469:     typedef FindArcTagIndicator<Digraph> FindArcTag;
kpeter@471:     Arc findArc(const Node& u, const Node& v, const Arc& prev = INVALID) const {
deba@430:       return _digraph->findArc(u, v, prev);
deba@430:     }
deba@432: 
deba@430:     Node addNode() { return _digraph->addNode(); }
deba@430:     Arc addArc(const Node& u, const Node& v) { return _digraph->addArc(u, v); }
deba@430: 
kpeter@471:     void erase(const Node& n) { _digraph->erase(n); }
kpeter@471:     void erase(const Arc& a) { _digraph->erase(a); }
kpeter@471: 
kpeter@471:     void clear() { _digraph->clear(); }
deba@432: 
deba@430:     int id(const Node& n) const { return _digraph->id(n); }
deba@430:     int id(const Arc& a) const { return _digraph->id(a); }
deba@430: 
deba@430:     Node nodeFromId(int ix) const { return _digraph->nodeFromId(ix); }
deba@430:     Arc arcFromId(int ix) const { return _digraph->arcFromId(ix); }
deba@430: 
deba@430:     int maxNodeId() const { return _digraph->maxNodeId(); }
deba@430:     int maxArcId() const { return _digraph->maxArcId(); }
deba@430: 
deba@430:     typedef typename ItemSetTraits<Digraph, Node>::ItemNotifier NodeNotifier;
deba@432:     NodeNotifier& notifier(Node) const { return _digraph->notifier(Node()); }
deba@430: 
deba@430:     typedef typename ItemSetTraits<Digraph, Arc>::ItemNotifier ArcNotifier;
deba@432:     ArcNotifier& notifier(Arc) const { return _digraph->notifier(Arc()); }
deba@432: 
deba@430:     template <typename _Value>
deba@430:     class NodeMap : public Digraph::template NodeMap<_Value> {
deba@430:     public:
deba@430: 
deba@430:       typedef typename Digraph::template NodeMap<_Value> Parent;
deba@430: 
deba@432:       explicit NodeMap(const Adaptor& adaptor)
deba@432:         : Parent(*adaptor._digraph) {}
deba@430: 
deba@430:       NodeMap(const Adaptor& adaptor, const _Value& value)
deba@432:         : Parent(*adaptor._digraph, value) { }
deba@430: 
deba@430:     private:
deba@430:       NodeMap& operator=(const NodeMap& cmap) {
deba@430:         return operator=<NodeMap>(cmap);
deba@430:       }
deba@430: 
deba@430:       template <typename CMap>
deba@430:       NodeMap& operator=(const CMap& cmap) {
deba@430:         Parent::operator=(cmap);
deba@430:         return *this;
deba@430:       }
deba@432: 
deba@430:     };
deba@430: 
deba@430:     template <typename _Value>
deba@430:     class ArcMap : public Digraph::template ArcMap<_Value> {
deba@430:     public:
deba@432: 
deba@430:       typedef typename Digraph::template ArcMap<_Value> Parent;
deba@432: 
deba@432:       explicit ArcMap(const Adaptor& adaptor)
deba@432:         : Parent(*adaptor._digraph) {}
deba@430: 
deba@430:       ArcMap(const Adaptor& adaptor, const _Value& value)
deba@432:         : Parent(*adaptor._digraph, value) {}
deba@430: 
deba@430:     private:
deba@430:       ArcMap& operator=(const ArcMap& cmap) {
deba@430:         return operator=<ArcMap>(cmap);
deba@430:       }
deba@430: 
deba@430:       template <typename CMap>
deba@430:       ArcMap& operator=(const CMap& cmap) {
deba@430:         Parent::operator=(cmap);
deba@430:         return *this;
deba@430:       }
deba@430: 
deba@430:     };
deba@430: 
deba@430:   };
deba@430: 
deba@432:   template<typename _Graph>
deba@432:   class GraphAdaptorBase {
deba@432:   public:
deba@432:     typedef _Graph Graph;
deba@432:     typedef Graph ParentGraph;
deba@432: 
deba@432:   protected:
deba@432:     Graph* _graph;
deba@432: 
deba@432:     GraphAdaptorBase() : _graph(0) {}
deba@432: 
deba@432:     void setGraph(Graph& graph) { _graph = &graph; }
deba@432: 
deba@432:   public:
deba@432:     GraphAdaptorBase(Graph& graph) : _graph(&graph) {}
deba@432: 
deba@432:     typedef typename Graph::Node Node;
deba@432:     typedef typename Graph::Arc Arc;
deba@432:     typedef typename Graph::Edge Edge;
deba@432: 
deba@432:     void first(Node& i) const { _graph->first(i); }
deba@432:     void first(Arc& i) const { _graph->first(i); }
deba@432:     void first(Edge& i) const { _graph->first(i); }
deba@432:     void firstIn(Arc& i, const Node& n) const { _graph->firstIn(i, n); }
deba@432:     void firstOut(Arc& i, const Node& n ) const { _graph->firstOut(i, n); }
deba@432:     void firstInc(Edge &i, bool &d, const Node &n) const {
deba@432:       _graph->firstInc(i, d, n);
deba@432:     }
deba@432: 
deba@432:     void next(Node& i) const { _graph->next(i); }
deba@432:     void next(Arc& i) const { _graph->next(i); }
deba@432:     void next(Edge& i) const { _graph->next(i); }
deba@432:     void nextIn(Arc& i) const { _graph->nextIn(i); }
deba@432:     void nextOut(Arc& i) const { _graph->nextOut(i); }
deba@432:     void nextInc(Edge &i, bool &d) const { _graph->nextInc(i, d); }
deba@432: 
deba@432:     Node u(const Edge& e) const { return _graph->u(e); }
deba@432:     Node v(const Edge& e) const { return _graph->v(e); }
deba@432: 
deba@432:     Node source(const Arc& a) const { return _graph->source(a); }
deba@432:     Node target(const Arc& a) const { return _graph->target(a); }
deba@432: 
deba@432:     typedef NodeNumTagIndicator<Graph> NodeNumTag;
deba@432:     int nodeNum() const { return _graph->nodeNum(); }
deba@432: 
kpeter@469:     typedef ArcNumTagIndicator<Graph> ArcNumTag;
kpeter@469:     int arcNum() const { return _graph->arcNum(); }
kpeter@469: 
deba@432:     typedef EdgeNumTagIndicator<Graph> EdgeNumTag;
deba@432:     int edgeNum() const { return _graph->edgeNum(); }
deba@432: 
kpeter@469:     typedef FindArcTagIndicator<Graph> FindArcTag;
kpeter@471:     Arc findArc(const Node& u, const Node& v,
kpeter@471:                 const Arc& prev = INVALID) const {
deba@432:       return _graph->findArc(u, v, prev);
deba@432:     }
kpeter@469: 
kpeter@469:     typedef FindEdgeTagIndicator<Graph> FindEdgeTag;
kpeter@471:     Edge findEdge(const Node& u, const Node& v,
kpeter@471:                   const Edge& prev = INVALID) const {
deba@432:       return _graph->findEdge(u, v, prev);
deba@432:     }
deba@432: 
deba@432:     Node addNode() { return _graph->addNode(); }
deba@432:     Edge addEdge(const Node& u, const Node& v) { return _graph->addEdge(u, v); }
deba@432: 
deba@432:     void erase(const Node& i) { _graph->erase(i); }
deba@432:     void erase(const Edge& i) { _graph->erase(i); }
deba@432: 
deba@432:     void clear() { _graph->clear(); }
deba@432: 
deba@432:     bool direction(const Arc& a) const { return _graph->direction(a); }
deba@432:     Arc direct(const Edge& e, bool d) const { return _graph->direct(e, d); }
deba@432: 
deba@432:     int id(const Node& v) const { return _graph->id(v); }
deba@432:     int id(const Arc& a) const { return _graph->id(a); }
deba@432:     int id(const Edge& e) const { return _graph->id(e); }
deba@432: 
deba@432:     Node nodeFromId(int ix) const { return _graph->nodeFromId(ix); }
deba@432:     Arc arcFromId(int ix) const { return _graph->arcFromId(ix); }
deba@432:     Edge edgeFromId(int ix) const { return _graph->edgeFromId(ix); }
deba@432: 
deba@432:     int maxNodeId() const { return _graph->maxNodeId(); }
deba@432:     int maxArcId() const { return _graph->maxArcId(); }
deba@432:     int maxEdgeId() const { return _graph->maxEdgeId(); }
deba@432: 
deba@432:     typedef typename ItemSetTraits<Graph, Node>::ItemNotifier NodeNotifier;
deba@432:     NodeNotifier& notifier(Node) const { return _graph->notifier(Node()); }
deba@432: 
deba@432:     typedef typename ItemSetTraits<Graph, Arc>::ItemNotifier ArcNotifier;
deba@432:     ArcNotifier& notifier(Arc) const { return _graph->notifier(Arc()); }
deba@432: 
deba@432:     typedef typename ItemSetTraits<Graph, Edge>::ItemNotifier EdgeNotifier;
deba@432:     EdgeNotifier& notifier(Edge) const { return _graph->notifier(Edge()); }
deba@432: 
deba@432:     template <typename _Value>
deba@432:     class NodeMap : public Graph::template NodeMap<_Value> {
deba@432:     public:
deba@432:       typedef typename Graph::template NodeMap<_Value> Parent;
deba@432:       explicit NodeMap(const GraphAdaptorBase<Graph>& adapter)
deba@432:         : Parent(*adapter._graph) {}
deba@432:       NodeMap(const GraphAdaptorBase<Graph>& adapter, const _Value& value)
deba@432:         : Parent(*adapter._graph, value) {}
deba@432: 
deba@432:     private:
deba@432:       NodeMap& operator=(const NodeMap& cmap) {
deba@432:         return operator=<NodeMap>(cmap);
deba@432:       }
deba@432: 
deba@432:       template <typename CMap>
deba@432:       NodeMap& operator=(const CMap& cmap) {
deba@432:         Parent::operator=(cmap);
deba@432:         return *this;
deba@432:       }
deba@432: 
deba@432:     };
deba@432: 
deba@432:     template <typename _Value>
deba@432:     class ArcMap : public Graph::template ArcMap<_Value> {
deba@432:     public:
deba@432:       typedef typename Graph::template ArcMap<_Value> Parent;
deba@432:       explicit ArcMap(const GraphAdaptorBase<Graph>& adapter)
deba@432:         : Parent(*adapter._graph) {}
deba@432:       ArcMap(const GraphAdaptorBase<Graph>& adapter, const _Value& value)
deba@432:         : Parent(*adapter._graph, value) {}
deba@432: 
deba@432:     private:
deba@432:       ArcMap& operator=(const ArcMap& cmap) {
deba@432:         return operator=<ArcMap>(cmap);
deba@432:       }
deba@432: 
deba@432:       template <typename CMap>
deba@432:       ArcMap& operator=(const CMap& cmap) {
deba@432:         Parent::operator=(cmap);
deba@432:         return *this;
deba@432:       }
deba@432:     };
deba@432: 
deba@432:     template <typename _Value>
deba@432:     class EdgeMap : public Graph::template EdgeMap<_Value> {
deba@432:     public:
deba@432:       typedef typename Graph::template EdgeMap<_Value> Parent;
deba@432:       explicit EdgeMap(const GraphAdaptorBase<Graph>& adapter)
deba@432:         : Parent(*adapter._graph) {}
deba@432:       EdgeMap(const GraphAdaptorBase<Graph>& adapter, const _Value& value)
deba@432:         : Parent(*adapter._graph, value) {}
deba@432: 
deba@432:     private:
deba@432:       EdgeMap& operator=(const EdgeMap& cmap) {
deba@432:         return operator=<EdgeMap>(cmap);
deba@432:       }
deba@432: 
deba@432:       template <typename CMap>
deba@432:       EdgeMap& operator=(const CMap& cmap) {
deba@432:         Parent::operator=(cmap);
deba@432:         return *this;
deba@432:       }
deba@432:     };
deba@432: 
deba@432:   };
deba@430: 
deba@430:   template <typename _Digraph>
deba@432:   class ReverseDigraphBase : public DigraphAdaptorBase<_Digraph> {
deba@430:   public:
deba@430:     typedef _Digraph Digraph;
deba@430:     typedef DigraphAdaptorBase<_Digraph> Parent;
deba@430:   protected:
deba@432:     ReverseDigraphBase() : Parent() { }
deba@430:   public:
deba@430:     typedef typename Parent::Node Node;
deba@430:     typedef typename Parent::Arc Arc;
deba@430: 
deba@430:     void firstIn(Arc& a, const Node& n) const { Parent::firstOut(a, n); }
deba@430:     void firstOut(Arc& a, const Node& n ) const { Parent::firstIn(a, n); }
deba@430: 
deba@430:     void nextIn(Arc& a) const { Parent::nextOut(a); }
deba@430:     void nextOut(Arc& a) const { Parent::nextIn(a); }
deba@430: 
deba@430:     Node source(const Arc& a) const { return Parent::target(a); }
deba@430:     Node target(const Arc& a) const { return Parent::source(a); }
deba@430: 
deba@432:     Arc addArc(const Node& u, const Node& v) { return Parent::addArc(v, u); }
deba@432: 
kpeter@469:     typedef FindArcTagIndicator<Digraph> FindArcTag;
deba@432:     Arc findArc(const Node& u, const Node& v,
kpeter@471:                 const Arc& prev = INVALID) const {
deba@430:       return Parent::findArc(v, u, prev);
deba@430:     }
deba@430: 
deba@430:   };
deba@432: 
deba@432:   /// \ingroup graph_adaptors
deba@430:   ///
kpeter@474:   /// \brief Adaptor class for reversing the orientation of the arcs in
kpeter@474:   /// a digraph.
deba@430:   ///
kpeter@474:   /// ReverseDigraph can be used for reversing the arcs in a digraph.
kpeter@474:   /// It conforms to the \ref concepts::Digraph "Digraph" concept.
deba@430:   ///
kpeter@474:   /// The adapted digraph can also be modified through this adaptor
kpeter@476:   /// by adding or removing nodes or arcs, unless the \c GR template
kpeter@474:   /// parameter is set to be \c const.
kpeter@474:   ///
kpeter@476:   /// \tparam GR The type of the adapted digraph.
kpeter@474:   /// It must conform to the \ref concepts::Digraph "Digraph" concept.
kpeter@474:   /// It can also be specified to be \c const.
kpeter@474:   ///
kpeter@474:   /// \note The \c Node and \c Arc types of this adaptor and the adapted
kpeter@474:   /// digraph are convertible to each other.
kpeter@476:   template<typename GR>
kpeter@476: #ifdef DOXYGEN
kpeter@476:   class ReverseDigraph {
kpeter@476: #else
deba@432:   class ReverseDigraph :
kpeter@476:     public DigraphAdaptorExtender<ReverseDigraphBase<GR> > {
kpeter@476: #endif
deba@430:   public:
kpeter@476:     /// The type of the adapted digraph.
kpeter@476:     typedef GR Digraph;
kpeter@476:     typedef DigraphAdaptorExtender<ReverseDigraphBase<GR> > Parent;
deba@430:   protected:
deba@432:     ReverseDigraph() { }
deba@430:   public:
deba@431: 
deba@431:     /// \brief Constructor
deba@431:     ///
kpeter@474:     /// Creates a reverse digraph adaptor for the given digraph.
deba@432:     explicit ReverseDigraph(Digraph& digraph) {
deba@432:       Parent::setDigraph(digraph);
deba@430:     }
deba@430:   };
deba@430: 
kpeter@474:   /// \brief Returns a read-only ReverseDigraph adaptor
deba@430:   ///
kpeter@474:   /// This function just returns a read-only \ref ReverseDigraph adaptor.
kpeter@474:   /// \ingroup graph_adaptors
kpeter@474:   /// \relates ReverseDigraph
kpeter@476:   template<typename GR>
kpeter@476:   ReverseDigraph<const GR> reverseDigraph(const GR& digraph) {
kpeter@476:     return ReverseDigraph<const GR>(digraph);
deba@430:   }
deba@430: 
kpeter@474: 
deba@432:   template <typename _Digraph, typename _NodeFilterMap,
deba@432:             typename _ArcFilterMap, bool _checked = true>
deba@432:   class SubDigraphBase : public DigraphAdaptorBase<_Digraph> {
deba@430:   public:
deba@430:     typedef _Digraph Digraph;
deba@430:     typedef _NodeFilterMap NodeFilterMap;
deba@430:     typedef _ArcFilterMap ArcFilterMap;
deba@430: 
deba@432:     typedef SubDigraphBase Adaptor;
deba@430:     typedef DigraphAdaptorBase<_Digraph> Parent;
deba@430:   protected:
deba@430:     NodeFilterMap* _node_filter;
deba@430:     ArcFilterMap* _arc_filter;
deba@432:     SubDigraphBase()
deba@430:       : Parent(), _node_filter(0), _arc_filter(0) { }
deba@430: 
deba@430:     void setNodeFilterMap(NodeFilterMap& node_filter) {
deba@430:       _node_filter = &node_filter;
deba@430:     }
deba@430:     void setArcFilterMap(ArcFilterMap& arc_filter) {
deba@430:       _arc_filter = &arc_filter;
deba@430:     }
deba@430: 
deba@430:   public:
deba@430: 
deba@430:     typedef typename Parent::Node Node;
deba@430:     typedef typename Parent::Arc Arc;
deba@430: 
deba@432:     void first(Node& i) const {
deba@432:       Parent::first(i);
deba@432:       while (i != INVALID && !(*_node_filter)[i]) Parent::next(i);
deba@430:     }
deba@430: 
deba@432:     void first(Arc& i) const {
deba@432:       Parent::first(i);
deba@432:       while (i != INVALID && (!(*_arc_filter)[i]
deba@432:                               || !(*_node_filter)[Parent::source(i)]
deba@432:                               || !(*_node_filter)[Parent::target(i)]))
deba@432:         Parent::next(i);
deba@430:     }
deba@430: 
deba@432:     void firstIn(Arc& i, const Node& n) const {
deba@432:       Parent::firstIn(i, n);
deba@432:       while (i != INVALID && (!(*_arc_filter)[i]
deba@432:                               || !(*_node_filter)[Parent::source(i)]))
deba@432:         Parent::nextIn(i);
deba@430:     }
deba@430: 
deba@432:     void firstOut(Arc& i, const Node& n) const {
deba@432:       Parent::firstOut(i, n);
deba@432:       while (i != INVALID && (!(*_arc_filter)[i]
deba@432:                               || !(*_node_filter)[Parent::target(i)]))
deba@432:         Parent::nextOut(i);
deba@430:     }
deba@430: 
deba@432:     void next(Node& i) const {
deba@432:       Parent::next(i);
deba@432:       while (i != INVALID && !(*_node_filter)[i]) Parent::next(i);
deba@430:     }
deba@430: 
deba@432:     void next(Arc& i) const {
deba@432:       Parent::next(i);
deba@432:       while (i != INVALID && (!(*_arc_filter)[i]
deba@432:                               || !(*_node_filter)[Parent::source(i)]
deba@432:                               || !(*_node_filter)[Parent::target(i)]))
deba@432:         Parent::next(i);
deba@430:     }
deba@430: 
deba@432:     void nextIn(Arc& i) const {
deba@432:       Parent::nextIn(i);
deba@432:       while (i != INVALID && (!(*_arc_filter)[i]
deba@432:                               || !(*_node_filter)[Parent::source(i)]))
deba@432:         Parent::nextIn(i);
deba@430:     }
deba@430: 
deba@432:     void nextOut(Arc& i) const {
deba@432:       Parent::nextOut(i);
deba@432:       while (i != INVALID && (!(*_arc_filter)[i]
deba@432:                               || !(*_node_filter)[Parent::target(i)]))
deba@432:         Parent::nextOut(i);
deba@430:     }
deba@430: 
kpeter@475:     void status(const Node& n, bool v) const { _node_filter->set(n, v); }
kpeter@475:     void status(const Arc& a, bool v) const { _arc_filter->set(a, v); }
kpeter@475: 
kpeter@475:     bool status(const Node& n) const { return (*_node_filter)[n]; }
kpeter@475:     bool status(const Arc& a) const { return (*_arc_filter)[a]; }
deba@430: 
deba@430:     typedef False NodeNumTag;
kpeter@469:     typedef False ArcNumTag;
kpeter@469: 
kpeter@469:     typedef FindArcTagIndicator<Digraph> FindArcTag;
deba@432:     Arc findArc(const Node& source, const Node& target,
kpeter@471:                 const Arc& prev = INVALID) const {
deba@430:       if (!(*_node_filter)[source] || !(*_node_filter)[target]) {
deba@430:         return INVALID;
deba@430:       }
deba@430:       Arc arc = Parent::findArc(source, target, prev);
deba@430:       while (arc != INVALID && !(*_arc_filter)[arc]) {
deba@430:         arc = Parent::findArc(source, target, arc);
deba@430:       }
deba@430:       return arc;
deba@430:     }
deba@430: 
deba@430:     template <typename _Value>
deba@432:     class NodeMap : public SubMapExtender<Adaptor,
deba@432:       typename Parent::template NodeMap<_Value> > {
deba@430:     public:
deba@430:       typedef _Value Value;
deba@430:       typedef SubMapExtender<Adaptor, typename Parent::
deba@430:                              template NodeMap<Value> > MapParent;
deba@432: 
deba@432:       NodeMap(const Adaptor& adaptor)
deba@432:         : MapParent(adaptor) {}
deba@432:       NodeMap(const Adaptor& adaptor, const Value& value)
deba@432:         : MapParent(adaptor, value) {}
deba@432: 
deba@430:     private:
deba@430:       NodeMap& operator=(const NodeMap& cmap) {
deba@432:         return operator=<NodeMap>(cmap);
deba@430:       }
deba@432: 
deba@430:       template <typename CMap>
deba@430:       NodeMap& operator=(const CMap& cmap) {
deba@430:         MapParent::operator=(cmap);
deba@432:         return *this;
deba@430:       }
deba@430:     };
deba@430: 
deba@430:     template <typename _Value>
deba@432:     class ArcMap : public SubMapExtender<Adaptor,
deba@432:       typename Parent::template ArcMap<_Value> > {
deba@430:     public:
deba@430:       typedef _Value Value;
deba@430:       typedef SubMapExtender<Adaptor, typename Parent::
deba@430:                              template ArcMap<Value> > MapParent;
deba@432: 
deba@432:       ArcMap(const Adaptor& adaptor)
deba@432:         : MapParent(adaptor) {}
deba@432:       ArcMap(const Adaptor& adaptor, const Value& value)
deba@432:         : MapParent(adaptor, value) {}
deba@432: 
deba@430:     private:
deba@430:       ArcMap& operator=(const ArcMap& cmap) {
deba@432:         return operator=<ArcMap>(cmap);
deba@430:       }
deba@432: 
deba@430:       template <typename CMap>
deba@430:       ArcMap& operator=(const CMap& cmap) {
deba@430:         MapParent::operator=(cmap);
deba@432:         return *this;
deba@430:       }
deba@430:     };
deba@430: 
deba@430:   };
deba@430: 
deba@430:   template <typename _Digraph, typename _NodeFilterMap, typename _ArcFilterMap>
deba@432:   class SubDigraphBase<_Digraph, _NodeFilterMap, _ArcFilterMap, false>
deba@430:     : public DigraphAdaptorBase<_Digraph> {
deba@430:   public:
deba@430:     typedef _Digraph Digraph;
deba@430:     typedef _NodeFilterMap NodeFilterMap;
deba@430:     typedef _ArcFilterMap ArcFilterMap;
deba@430: 
deba@432:     typedef SubDigraphBase Adaptor;
deba@430:     typedef DigraphAdaptorBase<Digraph> Parent;
deba@430:   protected:
deba@430:     NodeFilterMap* _node_filter;
deba@430:     ArcFilterMap* _arc_filter;
deba@432:     SubDigraphBase()
deba@430:       : Parent(), _node_filter(0), _arc_filter(0) { }
deba@430: 
deba@430:     void setNodeFilterMap(NodeFilterMap& node_filter) {
deba@430:       _node_filter = &node_filter;
deba@430:     }
deba@430:     void setArcFilterMap(ArcFilterMap& arc_filter) {
deba@430:       _arc_filter = &arc_filter;
deba@430:     }
deba@430: 
deba@430:   public:
deba@430: 
deba@430:     typedef typename Parent::Node Node;
deba@430:     typedef typename Parent::Arc Arc;
deba@430: 
deba@432:     void first(Node& i) const {
deba@432:       Parent::first(i);
deba@432:       while (i!=INVALID && !(*_node_filter)[i]) Parent::next(i);
deba@430:     }
deba@430: 
deba@432:     void first(Arc& i) const {
deba@432:       Parent::first(i);
deba@432:       while (i!=INVALID && !(*_arc_filter)[i]) Parent::next(i);
deba@430:     }
deba@430: 
deba@432:     void firstIn(Arc& i, const Node& n) const {
deba@432:       Parent::firstIn(i, n);
deba@432:       while (i!=INVALID && !(*_arc_filter)[i]) Parent::nextIn(i);
deba@430:     }
deba@430: 
deba@432:     void firstOut(Arc& i, const Node& n) const {
deba@432:       Parent::firstOut(i, n);
deba@432:       while (i!=INVALID && !(*_arc_filter)[i]) Parent::nextOut(i);
deba@430:     }
deba@430: 
deba@432:     void next(Node& i) const {
deba@432:       Parent::next(i);
deba@432:       while (i!=INVALID && !(*_node_filter)[i]) Parent::next(i);
deba@430:     }
deba@432:     void next(Arc& i) const {
deba@432:       Parent::next(i);
deba@432:       while (i!=INVALID && !(*_arc_filter)[i]) Parent::next(i);
deba@430:     }
deba@432:     void nextIn(Arc& i) const {
deba@432:       Parent::nextIn(i);
deba@432:       while (i!=INVALID && !(*_arc_filter)[i]) Parent::nextIn(i);
deba@430:     }
deba@430: 
deba@432:     void nextOut(Arc& i) const {
deba@432:       Parent::nextOut(i);
deba@432:       while (i!=INVALID && !(*_arc_filter)[i]) Parent::nextOut(i);
deba@430:     }
deba@430: 
kpeter@475:     void status(const Node& n, bool v) const { _node_filter->set(n, v); }
kpeter@475:     void status(const Arc& a, bool v) const { _arc_filter->set(a, v); }
kpeter@475: 
kpeter@475:     bool status(const Node& n) const { return (*_node_filter)[n]; }
kpeter@475:     bool status(const Arc& a) const { return (*_arc_filter)[a]; }
deba@430: 
deba@430:     typedef False NodeNumTag;
kpeter@469:     typedef False ArcNumTag;
kpeter@469: 
kpeter@469:     typedef FindArcTagIndicator<Digraph> FindArcTag;
deba@432:     Arc findArc(const Node& source, const Node& target,
kpeter@471:                 const Arc& prev = INVALID) const {
deba@430:       if (!(*_node_filter)[source] || !(*_node_filter)[target]) {
deba@430:         return INVALID;
deba@430:       }
deba@430:       Arc arc = Parent::findArc(source, target, prev);
deba@430:       while (arc != INVALID && !(*_arc_filter)[arc]) {
deba@430:         arc = Parent::findArc(source, target, arc);
deba@430:       }
deba@430:       return arc;
deba@430:     }
deba@430: 
deba@430:     template <typename _Value>
deba@432:     class NodeMap : public SubMapExtender<Adaptor,
deba@432:       typename Parent::template NodeMap<_Value> > {
deba@430:     public:
deba@430:       typedef _Value Value;
deba@430:       typedef SubMapExtender<Adaptor, typename Parent::
deba@430:                              template NodeMap<Value> > MapParent;
deba@432: 
deba@432:       NodeMap(const Adaptor& adaptor)
deba@432:         : MapParent(adaptor) {}
deba@432:       NodeMap(const Adaptor& adaptor, const Value& value)
deba@432:         : MapParent(adaptor, value) {}
deba@432: 
deba@430:     private:
deba@430:       NodeMap& operator=(const NodeMap& cmap) {
deba@432:         return operator=<NodeMap>(cmap);
deba@430:       }
deba@432: 
deba@430:       template <typename CMap>
deba@430:       NodeMap& operator=(const CMap& cmap) {
deba@430:         MapParent::operator=(cmap);
deba@432:         return *this;
deba@430:       }
deba@430:     };
deba@430: 
deba@430:     template <typename _Value>
deba@432:     class ArcMap : public SubMapExtender<Adaptor,
deba@432:       typename Parent::template ArcMap<_Value> > {
deba@430:     public:
deba@430:       typedef _Value Value;
deba@430:       typedef SubMapExtender<Adaptor, typename Parent::
deba@430:                              template ArcMap<Value> > MapParent;
deba@432: 
deba@432:       ArcMap(const Adaptor& adaptor)
deba@432:         : MapParent(adaptor) {}
deba@432:       ArcMap(const Adaptor& adaptor, const Value& value)
deba@432:         : MapParent(adaptor, value) {}
deba@432: 
deba@430:     private:
deba@430:       ArcMap& operator=(const ArcMap& cmap) {
deba@432:         return operator=<ArcMap>(cmap);
deba@430:       }
deba@432: 
deba@430:       template <typename CMap>
deba@430:       ArcMap& operator=(const CMap& cmap) {
deba@430:         MapParent::operator=(cmap);
deba@432:         return *this;
deba@430:       }
deba@430:     };
deba@430: 
deba@430:   };
deba@430: 
deba@430:   /// \ingroup graph_adaptors
deba@430:   ///
kpeter@474:   /// \brief Adaptor class for hiding nodes and arcs in a digraph
deba@432:   ///
kpeter@474:   /// SubDigraph can be used for hiding nodes and arcs in a digraph.
kpeter@474:   /// A \c bool node map and a \c bool arc map must be specified, which
kpeter@474:   /// define the filters for nodes and arcs.
kpeter@474:   /// Only the nodes and arcs with \c true filter value are
kpeter@476:   /// shown in the subdigraph. The arcs that are incident to hidden
kpeter@476:   /// nodes are also filtered out.
kpeter@476:   /// This adaptor conforms to the \ref concepts::Digraph "Digraph" concept.
deba@432:   ///
kpeter@474:   /// The adapted digraph can also be modified through this adaptor
kpeter@476:   /// by adding or removing nodes or arcs, unless the \c GR template
kpeter@474:   /// parameter is set to be \c const.
kpeter@474:   ///
kpeter@476:   /// \tparam GR The type of the adapted digraph.
kpeter@474:   /// It must conform to the \ref concepts::Digraph "Digraph" concept.
kpeter@474:   /// It can also be specified to be \c const.
kpeter@476:   /// \tparam NF The type of the node filter map.
kpeter@476:   /// It must be a \c bool (or convertible) node map of the
kpeter@476:   /// adapted digraph. The default type is
kpeter@476:   /// \ref concepts::Digraph::NodeMap "GR::NodeMap<bool>".
kpeter@476:   /// \tparam AF The type of the arc filter map.
kpeter@476:   /// It must be \c bool (or convertible) arc map of the
kpeter@476:   /// adapted digraph. The default type is
kpeter@476:   /// \ref concepts::Digraph::ArcMap "GR::ArcMap<bool>".
kpeter@474:   ///
kpeter@474:   /// \note The \c Node and \c Arc types of this adaptor and the adapted
kpeter@474:   /// digraph are convertible to each other.
deba@432:   ///
deba@432:   /// \see FilterNodes
deba@432:   /// \see FilterArcs
kpeter@474: #ifdef DOXYGEN
kpeter@476:   template<typename GR, typename NF, typename AF>
kpeter@476:   class SubDigraph {
kpeter@474: #else
kpeter@476:   template<typename GR,
kpeter@476:            typename NF = typename GR::template NodeMap<bool>,
kpeter@476:            typename AF = typename GR::template ArcMap<bool> >
kpeter@476:   class SubDigraph :
kpeter@476:     public DigraphAdaptorExtender<SubDigraphBase<GR, NF, AF, true> > {
kpeter@474: #endif
deba@430:   public:
kpeter@474:     /// The type of the adapted digraph.
kpeter@476:     typedef GR Digraph;
kpeter@474:     /// The type of the node filter map.
kpeter@476:     typedef NF NodeFilterMap;
kpeter@474:     /// The type of the arc filter map.
kpeter@476:     typedef AF ArcFilterMap;
kpeter@476: 
kpeter@476:     typedef DigraphAdaptorExtender<SubDigraphBase<GR, NF, AF, true> >
kpeter@476:       Parent;
deba@430: 
deba@431:     typedef typename Parent::Node Node;
deba@431:     typedef typename Parent::Arc Arc;
deba@431: 
deba@430:   protected:
deba@432:     SubDigraph() { }
deba@430:   public:
deba@430: 
deba@431:     /// \brief Constructor
deba@431:     ///
kpeter@474:     /// Creates a subdigraph for the given digraph with the
kpeter@474:     /// given node and arc filter maps.
deba@432:     SubDigraph(Digraph& digraph, NodeFilterMap& node_filter,
deba@432:                ArcFilterMap& arc_filter) {
deba@430:       setDigraph(digraph);
deba@430:       setNodeFilterMap(node_filter);
deba@430:       setArcFilterMap(arc_filter);
deba@430:     }
deba@430: 
kpeter@475:     /// \brief Sets the status of the given node
deba@431:     ///
kpeter@475:     /// This function sets the status of the given node.
kpeter@474:     /// It is done by simply setting the assigned value of \c n
kpeter@475:     /// to \c v in the node filter map.
kpeter@475:     void status(const Node& n, bool v) const { Parent::status(n, v); }
kpeter@475: 
kpeter@475:     /// \brief Sets the status of the given arc
deba@431:     ///
kpeter@475:     /// This function sets the status of the given arc.
kpeter@474:     /// It is done by simply setting the assigned value of \c a
kpeter@475:     /// to \c v in the arc filter map.
kpeter@475:     void status(const Arc& a, bool v) const { Parent::status(a, v); }
kpeter@475: 
kpeter@475:     /// \brief Returns the status of the given node
deba@431:     ///
kpeter@475:     /// This function returns the status of the given node.
kpeter@475:     /// It is \c true if the given node is enabled (i.e. not hidden).
kpeter@475:     bool status(const Node& n) const { return Parent::status(n); }
kpeter@475: 
kpeter@475:     /// \brief Returns the status of the given arc
deba@431:     ///
kpeter@475:     /// This function returns the status of the given arc.
kpeter@475:     /// It is \c true if the given arc is enabled (i.e. not hidden).
kpeter@475:     bool status(const Arc& a) const { return Parent::status(a); }
kpeter@475: 
kpeter@475:     /// \brief Disables the given node
deba@431:     ///
kpeter@475:     /// This function disables the given node in the subdigraph,
kpeter@475:     /// so the iteration jumps over it.
kpeter@475:     /// It is the same as \ref status() "status(n, false)".
kpeter@475:     void disable(const Node& n) const { Parent::status(n, false); }
kpeter@475: 
kpeter@475:     /// \brief Disables the given arc
deba@431:     ///
kpeter@475:     /// This function disables the given arc in the subdigraph,
kpeter@475:     /// so the iteration jumps over it.
kpeter@475:     /// It is the same as \ref status() "status(a, false)".
kpeter@475:     void disable(const Arc& a) const { Parent::status(a, false); }
kpeter@475: 
kpeter@475:     /// \brief Enables the given node
kpeter@475:     ///
kpeter@475:     /// This function enables the given node in the subdigraph.
kpeter@475:     /// It is the same as \ref status() "status(n, true)".
kpeter@475:     void enable(const Node& n) const { Parent::status(n, true); }
kpeter@475: 
kpeter@475:     /// \brief Enables the given arc
kpeter@475:     ///
kpeter@475:     /// This function enables the given arc in the subdigraph.
kpeter@475:     /// It is the same as \ref status() "status(a, true)".
kpeter@475:     void enable(const Arc& a) const { Parent::status(a, true); }
deba@431: 
deba@430:   };
deba@430: 
kpeter@474:   /// \brief Returns a read-only SubDigraph adaptor
deba@430:   ///
kpeter@474:   /// This function just returns a read-only \ref SubDigraph adaptor.
kpeter@474:   /// \ingroup graph_adaptors
kpeter@474:   /// \relates SubDigraph
kpeter@476:   template<typename GR, typename NF, typename AF>
kpeter@476:   SubDigraph<const GR, NF, AF>
kpeter@476:   subDigraph(const GR& digraph,
kpeter@476:              NF& node_filter_map, AF& arc_filter_map) {
kpeter@476:     return SubDigraph<const GR, NF, AF>
kpeter@476:       (digraph, node_filter_map, arc_filter_map);
deba@430:   }
deba@430: 
kpeter@476:   template<typename GR, typename NF, typename AF>
kpeter@476:   SubDigraph<const GR, const NF, AF>
kpeter@476:   subDigraph(const GR& digraph,
kpeter@476:              const NF& node_filter_map, AF& arc_filter_map) {
kpeter@476:     return SubDigraph<const GR, const NF, AF>
kpeter@476:       (digraph, node_filter_map, arc_filter_map);
deba@430:   }
deba@430: 
kpeter@476:   template<typename GR, typename NF, typename AF>
kpeter@476:   SubDigraph<const GR, NF, const AF>
kpeter@476:   subDigraph(const GR& digraph,
kpeter@476:              NF& node_filter_map, const AF& arc_filter_map) {
kpeter@476:     return SubDigraph<const GR, NF, const AF>
kpeter@476:       (digraph, node_filter_map, arc_filter_map);
deba@430:   }
deba@430: 
kpeter@476:   template<typename GR, typename NF, typename AF>
kpeter@476:   SubDigraph<const GR, const NF, const AF>
kpeter@476:   subDigraph(const GR& digraph,
kpeter@476:              const NF& node_filter_map, const AF& arc_filter_map) {
kpeter@476:     return SubDigraph<const GR, const NF, const AF>
kpeter@476:       (digraph, node_filter_map, arc_filter_map);
deba@430:   }
deba@430: 
deba@430: 
kpeter@472:   template <typename _Graph, typename _NodeFilterMap,
kpeter@472:             typename _EdgeFilterMap, bool _checked = true>
deba@432:   class SubGraphBase : public GraphAdaptorBase<_Graph> {
deba@432:   public:
deba@432:     typedef _Graph Graph;
kpeter@472:     typedef _NodeFilterMap NodeFilterMap;
kpeter@472:     typedef _EdgeFilterMap EdgeFilterMap;
kpeter@472: 
deba@432:     typedef SubGraphBase Adaptor;
deba@432:     typedef GraphAdaptorBase<_Graph> Parent;
deba@432:   protected:
deba@432: 
deba@432:     NodeFilterMap* _node_filter_map;
deba@432:     EdgeFilterMap* _edge_filter_map;
deba@432: 
deba@432:     SubGraphBase()
deba@432:       : Parent(), _node_filter_map(0), _edge_filter_map(0) { }
deba@432: 
deba@432:     void setNodeFilterMap(NodeFilterMap& node_filter_map) {
deba@432:       _node_filter_map=&node_filter_map;
deba@432:     }
deba@432:     void setEdgeFilterMap(EdgeFilterMap& edge_filter_map) {
deba@432:       _edge_filter_map=&edge_filter_map;
deba@432:     }
deba@432: 
deba@432:   public:
deba@432: 
deba@432:     typedef typename Parent::Node Node;
deba@432:     typedef typename Parent::Arc Arc;
deba@432:     typedef typename Parent::Edge Edge;
deba@432: 
deba@432:     void first(Node& i) const {
deba@432:       Parent::first(i);
deba@432:       while (i!=INVALID && !(*_node_filter_map)[i]) Parent::next(i);
deba@432:     }
deba@432: 
deba@432:     void first(Arc& i) const {
deba@432:       Parent::first(i);
deba@432:       while (i!=INVALID && (!(*_edge_filter_map)[i]
deba@432:                             || !(*_node_filter_map)[Parent::source(i)]
deba@432:                             || !(*_node_filter_map)[Parent::target(i)]))
deba@432:         Parent::next(i);
deba@432:     }
deba@432: 
deba@432:     void first(Edge& i) const {
deba@432:       Parent::first(i);
deba@432:       while (i!=INVALID && (!(*_edge_filter_map)[i]
deba@432:                             || !(*_node_filter_map)[Parent::u(i)]
deba@432:                             || !(*_node_filter_map)[Parent::v(i)]))
deba@432:         Parent::next(i);
deba@432:     }
deba@432: 
deba@432:     void firstIn(Arc& i, const Node& n) const {
deba@432:       Parent::firstIn(i, n);
deba@432:       while (i!=INVALID && (!(*_edge_filter_map)[i]
deba@432:                             || !(*_node_filter_map)[Parent::source(i)]))
deba@432:         Parent::nextIn(i);
deba@432:     }
deba@432: 
deba@432:     void firstOut(Arc& i, const Node& n) const {
deba@432:       Parent::firstOut(i, n);
deba@432:       while (i!=INVALID && (!(*_edge_filter_map)[i]
deba@432:                             || !(*_node_filter_map)[Parent::target(i)]))
deba@432:         Parent::nextOut(i);
deba@432:     }
deba@432: 
deba@432:     void firstInc(Edge& i, bool& d, const Node& n) const {
deba@432:       Parent::firstInc(i, d, n);
deba@432:       while (i!=INVALID && (!(*_edge_filter_map)[i]
deba@432:                             || !(*_node_filter_map)[Parent::u(i)]
deba@432:                             || !(*_node_filter_map)[Parent::v(i)]))
deba@432:         Parent::nextInc(i, d);
deba@432:     }
deba@432: 
deba@432:     void next(Node& i) const {
deba@432:       Parent::next(i);
deba@432:       while (i!=INVALID && !(*_node_filter_map)[i]) Parent::next(i);
deba@432:     }
deba@432: 
deba@432:     void next(Arc& i) const {
deba@432:       Parent::next(i);
deba@432:       while (i!=INVALID && (!(*_edge_filter_map)[i]
deba@432:                             || !(*_node_filter_map)[Parent::source(i)]
deba@432:                             || !(*_node_filter_map)[Parent::target(i)]))
deba@432:         Parent::next(i);
deba@432:     }
deba@432: 
deba@432:     void next(Edge& i) const {
deba@432:       Parent::next(i);
deba@432:       while (i!=INVALID && (!(*_edge_filter_map)[i]
deba@432:                             || !(*_node_filter_map)[Parent::u(i)]
deba@432:                             || !(*_node_filter_map)[Parent::v(i)]))
deba@432:         Parent::next(i);
deba@432:     }
deba@432: 
deba@432:     void nextIn(Arc& i) const {
deba@432:       Parent::nextIn(i);
deba@432:       while (i!=INVALID && (!(*_edge_filter_map)[i]
deba@432:                             || !(*_node_filter_map)[Parent::source(i)]))
deba@432:         Parent::nextIn(i);
deba@432:     }
deba@432: 
deba@432:     void nextOut(Arc& i) const {
deba@432:       Parent::nextOut(i);
deba@432:       while (i!=INVALID && (!(*_edge_filter_map)[i]
deba@432:                             || !(*_node_filter_map)[Parent::target(i)]))
deba@432:         Parent::nextOut(i);
deba@432:     }
deba@432: 
deba@432:     void nextInc(Edge& i, bool& d) const {
deba@432:       Parent::nextInc(i, d);
deba@432:       while (i!=INVALID && (!(*_edge_filter_map)[i]
deba@432:                             || !(*_node_filter_map)[Parent::u(i)]
deba@432:                             || !(*_node_filter_map)[Parent::v(i)]))
deba@432:         Parent::nextInc(i, d);
deba@432:     }
deba@432: 
kpeter@475:     void status(const Node& n, bool v) const { _node_filter_map->set(n, v); }
kpeter@475:     void status(const Edge& e, bool v) const { _edge_filter_map->set(e, v); }
kpeter@475: 
kpeter@475:     bool status(const Node& n) const { return (*_node_filter_map)[n]; }
kpeter@475:     bool status(const Edge& e) const { return (*_edge_filter_map)[e]; }
deba@432: 
deba@432:     typedef False NodeNumTag;
kpeter@469:     typedef False ArcNumTag;
deba@432:     typedef False EdgeNumTag;
deba@432: 
kpeter@469:     typedef FindArcTagIndicator<Graph> FindArcTag;
deba@432:     Arc findArc(const Node& u, const Node& v,
kpeter@471:                 const Arc& prev = INVALID) const {
deba@432:       if (!(*_node_filter_map)[u] || !(*_node_filter_map)[v]) {
deba@432:         return INVALID;
deba@432:       }
deba@432:       Arc arc = Parent::findArc(u, v, prev);
deba@432:       while (arc != INVALID && !(*_edge_filter_map)[arc]) {
deba@432:         arc = Parent::findArc(u, v, arc);
deba@432:       }
deba@432:       return arc;
deba@432:     }
kpeter@469: 
kpeter@469:     typedef FindEdgeTagIndicator<Graph> FindEdgeTag;
deba@432:     Edge findEdge(const Node& u, const Node& v,
kpeter@471:                   const Edge& prev = INVALID) const {
deba@432:       if (!(*_node_filter_map)[u] || !(*_node_filter_map)[v]) {
deba@432:         return INVALID;
deba@432:       }
deba@432:       Edge edge = Parent::findEdge(u, v, prev);
deba@432:       while (edge != INVALID && !(*_edge_filter_map)[edge]) {
deba@432:         edge = Parent::findEdge(u, v, edge);
deba@432:       }
deba@432:       return edge;
deba@432:     }
deba@432: 
deba@432:     template <typename _Value>
deba@432:     class NodeMap : public SubMapExtender<Adaptor,
deba@432:       typename Parent::template NodeMap<_Value> > {
deba@432:     public:
deba@432:       typedef _Value Value;
deba@432:       typedef SubMapExtender<Adaptor, typename Parent::
deba@432:                              template NodeMap<Value> > MapParent;
deba@432: 
deba@432:       NodeMap(const Adaptor& adaptor)
deba@432:         : MapParent(adaptor) {}
deba@432:       NodeMap(const Adaptor& adaptor, const Value& value)
deba@432:         : MapParent(adaptor, value) {}
deba@432: 
deba@432:     private:
deba@432:       NodeMap& operator=(const NodeMap& cmap) {
deba@432:         return operator=<NodeMap>(cmap);
deba@432:       }
deba@432: 
deba@432:       template <typename CMap>
deba@432:       NodeMap& operator=(const CMap& cmap) {
deba@432:         MapParent::operator=(cmap);
deba@432:         return *this;
deba@432:       }
deba@432:     };
deba@432: 
deba@432:     template <typename _Value>
deba@432:     class ArcMap : public SubMapExtender<Adaptor,
deba@432:       typename Parent::template ArcMap<_Value> > {
deba@432:     public:
deba@432:       typedef _Value Value;
deba@432:       typedef SubMapExtender<Adaptor, typename Parent::
deba@432:                              template ArcMap<Value> > MapParent;
deba@432: 
deba@432:       ArcMap(const Adaptor& adaptor)
deba@432:         : MapParent(adaptor) {}
deba@432:       ArcMap(const Adaptor& adaptor, const Value& value)
deba@432:         : MapParent(adaptor, value) {}
deba@432: 
deba@432:     private:
deba@432:       ArcMap& operator=(const ArcMap& cmap) {
deba@432:         return operator=<ArcMap>(cmap);
deba@432:       }
deba@432: 
deba@432:       template <typename CMap>
deba@432:       ArcMap& operator=(const CMap& cmap) {
deba@432:         MapParent::operator=(cmap);
deba@432:         return *this;
deba@432:       }
deba@432:     };
deba@432: 
deba@432:     template <typename _Value>
deba@432:     class EdgeMap : public SubMapExtender<Adaptor,
deba@432:       typename Parent::template EdgeMap<_Value> > {
deba@432:     public:
deba@432:       typedef _Value Value;
deba@432:       typedef SubMapExtender<Adaptor, typename Parent::
deba@432:                              template EdgeMap<Value> > MapParent;
deba@432: 
deba@432:       EdgeMap(const Adaptor& adaptor)
deba@432:         : MapParent(adaptor) {}
deba@432: 
deba@432:       EdgeMap(const Adaptor& adaptor, const Value& value)
deba@432:         : MapParent(adaptor, value) {}
deba@432: 
deba@432:     private:
deba@432:       EdgeMap& operator=(const EdgeMap& cmap) {
deba@432:         return operator=<EdgeMap>(cmap);
deba@432:       }
deba@432: 
deba@432:       template <typename CMap>
deba@432:       EdgeMap& operator=(const CMap& cmap) {
deba@432:         MapParent::operator=(cmap);
deba@432:         return *this;
deba@432:       }
deba@432:     };
deba@432: 
deba@432:   };
deba@432: 
kpeter@472:   template <typename _Graph, typename _NodeFilterMap, typename _EdgeFilterMap>
kpeter@472:   class SubGraphBase<_Graph, _NodeFilterMap, _EdgeFilterMap, false>
deba@432:     : public GraphAdaptorBase<_Graph> {
deba@432:   public:
deba@432:     typedef _Graph Graph;
kpeter@472:     typedef _NodeFilterMap NodeFilterMap;
kpeter@472:     typedef _EdgeFilterMap EdgeFilterMap;
kpeter@472: 
deba@432:     typedef SubGraphBase Adaptor;
deba@432:     typedef GraphAdaptorBase<_Graph> Parent;
deba@432:   protected:
deba@432:     NodeFilterMap* _node_filter_map;
deba@432:     EdgeFilterMap* _edge_filter_map;
deba@432:     SubGraphBase() : Parent(),
deba@432:                      _node_filter_map(0), _edge_filter_map(0) { }
deba@432: 
deba@432:     void setNodeFilterMap(NodeFilterMap& node_filter_map) {
deba@432:       _node_filter_map=&node_filter_map;
deba@432:     }
deba@432:     void setEdgeFilterMap(EdgeFilterMap& edge_filter_map) {
deba@432:       _edge_filter_map=&edge_filter_map;
deba@432:     }
deba@432: 
deba@432:   public:
deba@432: 
deba@432:     typedef typename Parent::Node Node;
deba@432:     typedef typename Parent::Arc Arc;
deba@432:     typedef typename Parent::Edge Edge;
deba@432: 
deba@432:     void first(Node& i) const {
deba@432:       Parent::first(i);
deba@432:       while (i!=INVALID && !(*_node_filter_map)[i]) Parent::next(i);
deba@432:     }
deba@432: 
deba@432:     void first(Arc& i) const {
deba@432:       Parent::first(i);
deba@432:       while (i!=INVALID && !(*_edge_filter_map)[i]) Parent::next(i);
deba@432:     }
deba@432: 
deba@432:     void first(Edge& i) const {
deba@432:       Parent::first(i);
deba@432:       while (i!=INVALID && !(*_edge_filter_map)[i]) Parent::next(i);
deba@432:     }
deba@432: 
deba@432:     void firstIn(Arc& i, const Node& n) const {
deba@432:       Parent::firstIn(i, n);
deba@432:       while (i!=INVALID && !(*_edge_filter_map)[i]) Parent::nextIn(i);
deba@432:     }
deba@432: 
deba@432:     void firstOut(Arc& i, const Node& n) const {
deba@432:       Parent::firstOut(i, n);
deba@432:       while (i!=INVALID && !(*_edge_filter_map)[i]) Parent::nextOut(i);
deba@432:     }
deba@432: 
deba@432:     void firstInc(Edge& i, bool& d, const Node& n) const {
deba@432:       Parent::firstInc(i, d, n);
deba@432:       while (i!=INVALID && !(*_edge_filter_map)[i]) Parent::nextInc(i, d);
deba@432:     }
deba@432: 
deba@432:     void next(Node& i) const {
deba@432:       Parent::next(i);
deba@432:       while (i!=INVALID && !(*_node_filter_map)[i]) Parent::next(i);
deba@432:     }
deba@432:     void next(Arc& i) const {
deba@432:       Parent::next(i);
deba@432:       while (i!=INVALID && !(*_edge_filter_map)[i]) Parent::next(i);
deba@432:     }
deba@432:     void next(Edge& i) const {
deba@432:       Parent::next(i);
deba@432:       while (i!=INVALID && !(*_edge_filter_map)[i]) Parent::next(i);
deba@432:     }
deba@432:     void nextIn(Arc& i) const {
deba@432:       Parent::nextIn(i);
deba@432:       while (i!=INVALID && !(*_edge_filter_map)[i]) Parent::nextIn(i);
deba@432:     }
deba@432: 
deba@432:     void nextOut(Arc& i) const {
deba@432:       Parent::nextOut(i);
deba@432:       while (i!=INVALID && !(*_edge_filter_map)[i]) Parent::nextOut(i);
deba@432:     }
deba@432:     void nextInc(Edge& i, bool& d) const {
deba@432:       Parent::nextInc(i, d);
deba@432:       while (i!=INVALID && !(*_edge_filter_map)[i]) Parent::nextInc(i, d);
deba@432:     }
deba@432: 
kpeter@475:     void status(const Node& n, bool v) const { _node_filter_map->set(n, v); }
kpeter@475:     void status(const Edge& e, bool v) const { _edge_filter_map->set(e, v); }
kpeter@475: 
kpeter@475:     bool status(const Node& n) const { return (*_node_filter_map)[n]; }
kpeter@475:     bool status(const Edge& e) const { return (*_edge_filter_map)[e]; }
deba@432: 
deba@432:     typedef False NodeNumTag;
kpeter@469:     typedef False ArcNumTag;
deba@432:     typedef False EdgeNumTag;
deba@432: 
kpeter@469:     typedef FindArcTagIndicator<Graph> FindArcTag;
deba@432:     Arc findArc(const Node& u, const Node& v,
kpeter@471:                 const Arc& prev = INVALID) const {
deba@432:       Arc arc = Parent::findArc(u, v, prev);
deba@432:       while (arc != INVALID && !(*_edge_filter_map)[arc]) {
deba@432:         arc = Parent::findArc(u, v, arc);
deba@432:       }
deba@432:       return arc;
deba@432:     }
kpeter@469: 
kpeter@469:     typedef FindEdgeTagIndicator<Graph> FindEdgeTag;
deba@432:     Edge findEdge(const Node& u, const Node& v,
kpeter@471:                   const Edge& prev = INVALID) const {
deba@432:       Edge edge = Parent::findEdge(u, v, prev);
deba@432:       while (edge != INVALID && !(*_edge_filter_map)[edge]) {
deba@432:         edge = Parent::findEdge(u, v, edge);
deba@432:       }
deba@432:       return edge;
deba@432:     }
deba@432: 
deba@432:     template <typename _Value>
deba@432:     class NodeMap : public SubMapExtender<Adaptor,
deba@432:       typename Parent::template NodeMap<_Value> > {
deba@432:     public:
deba@432:       typedef _Value Value;
deba@432:       typedef SubMapExtender<Adaptor, typename Parent::
deba@432:                              template NodeMap<Value> > MapParent;
deba@432: 
deba@432:       NodeMap(const Adaptor& adaptor)
deba@432:         : MapParent(adaptor) {}
deba@432:       NodeMap(const Adaptor& adaptor, const Value& value)
deba@432:         : MapParent(adaptor, value) {}
deba@432: 
deba@432:     private:
deba@432:       NodeMap& operator=(const NodeMap& cmap) {
deba@432:         return operator=<NodeMap>(cmap);
deba@432:       }
deba@432: 
deba@432:       template <typename CMap>
deba@432:       NodeMap& operator=(const CMap& cmap) {
deba@432:         MapParent::operator=(cmap);
deba@432:         return *this;
deba@432:       }
deba@432:     };
deba@432: 
deba@432:     template <typename _Value>
deba@432:     class ArcMap : public SubMapExtender<Adaptor,
deba@432:       typename Parent::template ArcMap<_Value> > {
deba@432:     public:
deba@432:       typedef _Value Value;
deba@432:       typedef SubMapExtender<Adaptor, typename Parent::
deba@432:                              template ArcMap<Value> > MapParent;
deba@432: 
deba@432:       ArcMap(const Adaptor& adaptor)
deba@432:         : MapParent(adaptor) {}
deba@432:       ArcMap(const Adaptor& adaptor, const Value& value)
deba@432:         : MapParent(adaptor, value) {}
deba@432: 
deba@432:     private:
deba@432:       ArcMap& operator=(const ArcMap& cmap) {
deba@432:         return operator=<ArcMap>(cmap);
deba@432:       }
deba@432: 
deba@432:       template <typename CMap>
deba@432:       ArcMap& operator=(const CMap& cmap) {
deba@432:         MapParent::operator=(cmap);
deba@432:         return *this;
deba@432:       }
deba@432:     };
deba@432: 
deba@432:     template <typename _Value>
deba@432:     class EdgeMap : public SubMapExtender<Adaptor,
deba@432:       typename Parent::template EdgeMap<_Value> > {
deba@432:     public:
deba@432:       typedef _Value Value;
deba@432:       typedef SubMapExtender<Adaptor, typename Parent::
deba@432:                              template EdgeMap<Value> > MapParent;
deba@432: 
deba@432:       EdgeMap(const Adaptor& adaptor)
deba@432:         : MapParent(adaptor) {}
deba@432: 
deba@432:       EdgeMap(const Adaptor& adaptor, const _Value& value)
deba@432:         : MapParent(adaptor, value) {}
deba@432: 
deba@432:     private:
deba@432:       EdgeMap& operator=(const EdgeMap& cmap) {
deba@432:         return operator=<EdgeMap>(cmap);
deba@432:       }
deba@432: 
deba@432:       template <typename CMap>
deba@432:       EdgeMap& operator=(const CMap& cmap) {
deba@432:         MapParent::operator=(cmap);
deba@432:         return *this;
deba@432:       }
deba@432:     };
deba@432: 
deba@432:   };
deba@432: 
deba@432:   /// \ingroup graph_adaptors
deba@430:   ///
kpeter@474:   /// \brief Adaptor class for hiding nodes and edges in an undirected
kpeter@474:   /// graph.
deba@430:   ///
kpeter@474:   /// SubGraph can be used for hiding nodes and edges in a graph.
kpeter@474:   /// A \c bool node map and a \c bool edge map must be specified, which
kpeter@474:   /// define the filters for nodes and edges.
kpeter@474:   /// Only the nodes and edges with \c true filter value are
kpeter@476:   /// shown in the subgraph. The edges that are incident to hidden
kpeter@476:   /// nodes are also filtered out.
kpeter@476:   /// This adaptor conforms to the \ref concepts::Graph "Graph" concept.
deba@432:   ///
kpeter@474:   /// The adapted graph can also be modified through this adaptor
kpeter@476:   /// by adding or removing nodes or edges, unless the \c GR template
kpeter@474:   /// parameter is set to be \c const.
kpeter@474:   ///
kpeter@476:   /// \tparam GR The type of the adapted graph.
kpeter@474:   /// It must conform to the \ref concepts::Graph "Graph" concept.
kpeter@474:   /// It can also be specified to be \c const.
kpeter@476:   /// \tparam NF The type of the node filter map.
kpeter@476:   /// It must be a \c bool (or convertible) node map of the
kpeter@476:   /// adapted graph. The default type is
kpeter@476:   /// \ref concepts::Graph::NodeMap "GR::NodeMap<bool>".
kpeter@476:   /// \tparam EF The type of the edge filter map.
kpeter@476:   /// It must be a \c bool (or convertible) edge map of the
kpeter@476:   /// adapted graph. The default type is
kpeter@476:   /// \ref concepts::Graph::EdgeMap "GR::EdgeMap<bool>".
kpeter@474:   ///
kpeter@474:   /// \note The \c Node, \c Edge and \c Arc types of this adaptor and the
kpeter@474:   /// adapted graph are convertible to each other.
deba@432:   ///
deba@432:   /// \see FilterNodes
deba@432:   /// \see FilterEdges
kpeter@474: #ifdef DOXYGEN
kpeter@476:   template<typename GR, typename NF, typename EF>
kpeter@476:   class SubGraph {
kpeter@474: #else
kpeter@476:   template<typename GR,
kpeter@476:            typename NF = typename GR::template NodeMap<bool>,
kpeter@476:            typename EF = typename GR::template EdgeMap<bool> >
kpeter@476:   class SubGraph :
kpeter@476:     public GraphAdaptorExtender<SubGraphBase<GR, NF, EF, true> > {
kpeter@474: #endif
deba@430:   public:
kpeter@474:     /// The type of the adapted graph.
kpeter@476:     typedef GR Graph;
kpeter@474:     /// The type of the node filter map.
kpeter@476:     typedef NF NodeFilterMap;
kpeter@474:     /// The type of the edge filter map.
kpeter@476:     typedef EF EdgeFilterMap;
kpeter@476: 
kpeter@476:     typedef GraphAdaptorExtender< SubGraphBase<GR, NF, EF, true> >
kpeter@476:       Parent;
deba@430: 
deba@431:     typedef typename Parent::Node Node;
deba@432:     typedef typename Parent::Edge Edge;
deba@431: 
deba@430:   protected:
deba@432:     SubGraph() { }
deba@430:   public:
deba@430: 
deba@431:     /// \brief Constructor
deba@431:     ///
kpeter@474:     /// Creates a subgraph for the given graph with the given node
kpeter@474:     /// and edge filter maps.
kpeter@474:     SubGraph(Graph& graph, NodeFilterMap& node_filter_map,
deba@432:              EdgeFilterMap& edge_filter_map) {
kpeter@474:       setGraph(graph);
deba@432:       setNodeFilterMap(node_filter_map);
deba@432:       setEdgeFilterMap(edge_filter_map);
deba@430:     }
deba@430: 
kpeter@475:     /// \brief Sets the status of the given node
deba@431:     ///
kpeter@475:     /// This function sets the status of the given node.
kpeter@474:     /// It is done by simply setting the assigned value of \c n
kpeter@475:     /// to \c v in the node filter map.
kpeter@475:     void status(const Node& n, bool v) const { Parent::status(n, v); }
kpeter@475: 
kpeter@475:     /// \brief Sets the status of the given edge
deba@432:     ///
kpeter@475:     /// This function sets the status of the given edge.
kpeter@474:     /// It is done by simply setting the assigned value of \c e
kpeter@475:     /// to \c v in the edge filter map.
kpeter@475:     void status(const Edge& e, bool v) const { Parent::status(e, v); }
kpeter@475: 
kpeter@475:     /// \brief Returns the status of the given node
deba@431:     ///
kpeter@475:     /// This function returns the status of the given node.
kpeter@475:     /// It is \c true if the given node is enabled (i.e. not hidden).
kpeter@475:     bool status(const Node& n) const { return Parent::status(n); }
kpeter@475: 
kpeter@475:     /// \brief Returns the status of the given edge
deba@432:     ///
kpeter@475:     /// This function returns the status of the given edge.
kpeter@475:     /// It is \c true if the given edge is enabled (i.e. not hidden).
kpeter@475:     bool status(const Edge& e) const { return Parent::status(e); }
kpeter@475: 
kpeter@475:     /// \brief Disables the given node
deba@431:     ///
kpeter@475:     /// This function disables the given node in the subdigraph,
kpeter@475:     /// so the iteration jumps over it.
kpeter@475:     /// It is the same as \ref status() "status(n, false)".
kpeter@475:     void disable(const Node& n) const { Parent::status(n, false); }
kpeter@475: 
kpeter@475:     /// \brief Disables the given edge
deba@431:     ///
kpeter@475:     /// This function disables the given edge in the subgraph,
kpeter@475:     /// so the iteration jumps over it.
kpeter@475:     /// It is the same as \ref status() "status(e, false)".
kpeter@475:     void disable(const Edge& e) const { Parent::status(e, false); }
kpeter@475: 
kpeter@475:     /// \brief Enables the given node
kpeter@475:     ///
kpeter@475:     /// This function enables the given node in the subdigraph.
kpeter@475:     /// It is the same as \ref status() "status(n, true)".
kpeter@475:     void enable(const Node& n) const { Parent::status(n, true); }
kpeter@475: 
kpeter@475:     /// \brief Enables the given edge
kpeter@475:     ///
kpeter@475:     /// This function enables the given edge in the subgraph.
kpeter@475:     /// It is the same as \ref status() "status(e, true)".
kpeter@475:     void enable(const Edge& e) const { Parent::status(e, true); }
kpeter@475: 
deba@430:   };
deba@430: 
kpeter@474:   /// \brief Returns a read-only SubGraph adaptor
deba@430:   ///
kpeter@474:   /// This function just returns a read-only \ref SubGraph adaptor.
kpeter@474:   /// \ingroup graph_adaptors
kpeter@474:   /// \relates SubGraph
kpeter@476:   template<typename GR, typename NF, typename EF>
kpeter@476:   SubGraph<const GR, NF, EF>
kpeter@476:   subGraph(const GR& graph,
kpeter@476:            NF& node_filter_map, EF& edge_filter_map) {
kpeter@476:     return SubGraph<const GR, NF, EF>
kpeter@476:       (graph, node_filter_map, edge_filter_map);
deba@432:   }
deba@432: 
kpeter@476:   template<typename GR, typename NF, typename EF>
kpeter@476:   SubGraph<const GR, const NF, EF>
kpeter@476:   subGraph(const GR& graph,
kpeter@476:            const NF& node_filter_map, EF& edge_filter_map) {
kpeter@476:     return SubGraph<const GR, const NF, EF>
kpeter@476:       (graph, node_filter_map, edge_filter_map);
deba@432:   }
deba@432: 
kpeter@476:   template<typename GR, typename NF, typename EF>
kpeter@476:   SubGraph<const GR, NF, const EF>
kpeter@476:   subGraph(const GR& graph,
kpeter@476:            NF& node_filter_map, const EF& edge_filter_map) {
kpeter@476:     return SubGraph<const GR, NF, const EF>
kpeter@476:       (graph, node_filter_map, edge_filter_map);
deba@432:   }
deba@432: 
kpeter@476:   template<typename GR, typename NF, typename EF>
kpeter@476:   SubGraph<const GR, const NF, const EF>
kpeter@476:   subGraph(const GR& graph,
kpeter@476:            const NF& node_filter_map, const EF& edge_filter_map) {
kpeter@476:     return SubGraph<const GR, const NF, const EF>
kpeter@476:       (graph, node_filter_map, edge_filter_map);
deba@432:   }
deba@432: 
kpeter@474: 
deba@432:   /// \ingroup graph_adaptors
deba@432:   ///
kpeter@474:   /// \brief Adaptor class for hiding nodes in a digraph or a graph.
deba@432:   ///
kpeter@474:   /// FilterNodes adaptor can be used for hiding nodes in a digraph or a
kpeter@474:   /// graph. A \c bool node map must be specified, which defines the filter
kpeter@474:   /// for the nodes. Only the nodes with \c true filter value and the
kpeter@474:   /// arcs/edges incident to nodes both with \c true filter value are shown
kpeter@474:   /// in the subgraph. This adaptor conforms to the \ref concepts::Digraph
kpeter@474:   /// "Digraph" concept or the \ref concepts::Graph "Graph" concept
kpeter@476:   /// depending on the \c GR template parameter.
deba@432:   ///
kpeter@474:   /// The adapted (di)graph can also be modified through this adaptor
kpeter@476:   /// by adding or removing nodes or arcs/edges, unless the \c GR template
kpeter@474:   /// parameter is set to be \c const.
kpeter@474:   ///
kpeter@476:   /// \tparam GR The type of the adapted digraph or graph.
kpeter@474:   /// It must conform to the \ref concepts::Digraph "Digraph" concept
kpeter@474:   /// or the \ref concepts::Graph "Graph" concept.
kpeter@474:   /// It can also be specified to be \c const.
kpeter@476:   /// \tparam NF The type of the node filter map.
kpeter@476:   /// It must be a \c bool (or convertible) node map of the
kpeter@476:   /// adapted (di)graph. The default type is
kpeter@476:   /// \ref concepts::Graph::NodeMap "GR::NodeMap<bool>".
kpeter@474:   ///
kpeter@474:   /// \note The \c Node and <tt>Arc/Edge</tt> types of this adaptor and the
kpeter@474:   /// adapted (di)graph are convertible to each other.
deba@432: #ifdef DOXYGEN
kpeter@476:   template<typename GR, typename NF>
kpeter@476:   class FilterNodes {
deba@432: #else
kpeter@476:   template<typename GR,
kpeter@476:            typename NF = typename GR::template NodeMap<bool>,
deba@432:            typename Enable = void>
kpeter@476:   class FilterNodes :
kpeter@476:     public DigraphAdaptorExtender<
kpeter@476:       SubDigraphBase<GR, NF, ConstMap<typename GR::Arc, bool>, true> > {
deba@432: #endif
deba@432:   public:
deba@432: 
kpeter@476:     typedef GR Digraph;
kpeter@476:     typedef NF NodeFilterMap;
kpeter@476: 
kpeter@476:     typedef DigraphAdaptorExtender<
kpeter@476:       SubDigraphBase<GR, NF, ConstMap<typename GR::Arc, bool>, true> >
kpeter@476:       Parent;
deba@432: 
deba@432:     typedef typename Parent::Node Node;
deba@432: 
deba@432:   protected:
deba@432:     ConstMap<typename Digraph::Arc, bool> const_true_map;
deba@432: 
deba@432:     FilterNodes() : const_true_map(true) {
deba@432:       Parent::setArcFilterMap(const_true_map);
deba@432:     }
deba@432: 
deba@432:   public:
deba@432: 
deba@432:     /// \brief Constructor
deba@432:     ///
kpeter@474:     /// Creates a subgraph for the given digraph or graph with the
deba@432:     /// given node filter map.
kpeter@476:     FilterNodes(GR& graph, NodeFilterMap& node_filter) :
kpeter@476:       Parent(), const_true_map(true)
kpeter@476:     {
kpeter@474:       Parent::setDigraph(graph);
deba@432:       Parent::setNodeFilterMap(node_filter);
deba@432:       Parent::setArcFilterMap(const_true_map);
deba@432:     }
deba@432: 
kpeter@475:     /// \brief Sets the status of the given node
deba@432:     ///
kpeter@475:     /// This function sets the status of the given node.
kpeter@474:     /// It is done by simply setting the assigned value of \c n
kpeter@475:     /// to \c v in the node filter map.
kpeter@475:     void status(const Node& n, bool v) const { Parent::status(n, v); }
kpeter@475: 
kpeter@475:     /// \brief Returns the status of the given node
deba@432:     ///
kpeter@475:     /// This function returns the status of the given node.
kpeter@475:     /// It is \c true if the given node is enabled (i.e. not hidden).
kpeter@475:     bool status(const Node& n) const { return Parent::status(n); }
kpeter@475: 
kpeter@475:     /// \brief Disables the given node
deba@432:     ///
kpeter@475:     /// This function disables the given node, so the iteration
kpeter@475:     /// jumps over it.
kpeter@475:     /// It is the same as \ref status() "status(n, false)".
kpeter@475:     void disable(const Node& n) const { Parent::status(n, false); }
kpeter@475: 
kpeter@475:     /// \brief Enables the given node
kpeter@475:     ///
kpeter@475:     /// This function enables the given node.
kpeter@475:     /// It is the same as \ref status() "status(n, true)".
kpeter@475:     void enable(const Node& n) const { Parent::status(n, true); }
deba@432: 
deba@432:   };
deba@432: 
kpeter@476:   template<typename GR, typename NF>
kpeter@476:   class FilterNodes<GR, NF,
kpeter@476:                     typename enable_if<UndirectedTagIndicator<GR> >::type> :
kpeter@476:     public GraphAdaptorExtender<
kpeter@476:       SubGraphBase<GR, NF, ConstMap<typename GR::Edge, bool>, true> > {
kpeter@476: 
deba@432:   public:
kpeter@476:     typedef GR Graph;
kpeter@476:     typedef NF NodeFilterMap;
kpeter@476:     typedef GraphAdaptorExtender<
kpeter@476:       SubGraphBase<GR, NF, ConstMap<typename GR::Edge, bool>, true> >
kpeter@476:       Parent;
deba@432: 
deba@432:     typedef typename Parent::Node Node;
deba@432:   protected:
deba@432:     ConstMap<typename Graph::Edge, bool> const_true_map;
deba@432: 
deba@432:     FilterNodes() : const_true_map(true) {
deba@432:       Parent::setEdgeFilterMap(const_true_map);
deba@432:     }
deba@432: 
deba@432:   public:
deba@432: 
deba@432:     FilterNodes(Graph& _graph, NodeFilterMap& node_filter_map) :
deba@432:       Parent(), const_true_map(true) {
deba@432:       Parent::setGraph(_graph);
deba@432:       Parent::setNodeFilterMap(node_filter_map);
deba@432:       Parent::setEdgeFilterMap(const_true_map);
deba@432:     }
deba@432: 
kpeter@475:     void status(const Node& n, bool v) const { Parent::status(n, v); }
kpeter@475:     bool status(const Node& n) const { return Parent::status(n); }
kpeter@475:     void disable(const Node& n) const { Parent::status(n, false); }
kpeter@475:     void enable(const Node& n) const { Parent::status(n, true); }
deba@432: 
deba@432:   };
deba@432: 
deba@432: 
kpeter@474:   /// \brief Returns a read-only FilterNodes adaptor
deba@432:   ///
kpeter@474:   /// This function just returns a read-only \ref FilterNodes adaptor.
kpeter@474:   /// \ingroup graph_adaptors
kpeter@474:   /// \relates FilterNodes
kpeter@476:   template<typename GR, typename NF>
kpeter@476:   FilterNodes<const GR, NF>
kpeter@476:   filterNodes(const GR& graph, NF& node_filter_map) {
kpeter@476:     return FilterNodes<const GR, NF>(graph, node_filter_map);
deba@430:   }
deba@430: 
kpeter@476:   template<typename GR, typename NF>
kpeter@476:   FilterNodes<const GR, const NF>
kpeter@476:   filterNodes(const GR& graph, const NF& node_filter_map) {
kpeter@476:     return FilterNodes<const GR, const NF>(graph, node_filter_map);
deba@430:   }
deba@430: 
deba@432:   /// \ingroup graph_adaptors
deba@430:   ///
kpeter@474:   /// \brief Adaptor class for hiding arcs in a digraph.
deba@430:   ///
kpeter@474:   /// FilterArcs adaptor can be used for hiding arcs in a digraph.
kpeter@474:   /// A \c bool arc map must be specified, which defines the filter for
kpeter@474:   /// the arcs. Only the arcs with \c true filter value are shown in the
kpeter@474:   /// subdigraph. This adaptor conforms to the \ref concepts::Digraph
kpeter@474:   /// "Digraph" concept.
deba@430:   ///
kpeter@474:   /// The adapted digraph can also be modified through this adaptor
kpeter@476:   /// by adding or removing nodes or arcs, unless the \c GR template
kpeter@474:   /// parameter is set to be \c const.
kpeter@474:   ///
kpeter@476:   /// \tparam GR The type of the adapted digraph.
kpeter@474:   /// It must conform to the \ref concepts::Digraph "Digraph" concept.
kpeter@474:   /// It can also be specified to be \c const.
kpeter@476:   /// \tparam AF The type of the arc filter map.
kpeter@476:   /// It must be a \c bool (or convertible) arc map of the
kpeter@476:   /// adapted digraph. The default type is
kpeter@476:   /// \ref concepts::Digraph::ArcMap "GR::ArcMap<bool>".
kpeter@474:   ///
kpeter@474:   /// \note The \c Node and \c Arc types of this adaptor and the adapted
kpeter@474:   /// digraph are convertible to each other.
kpeter@474: #ifdef DOXYGEN
kpeter@476:   template<typename GR,
kpeter@476:            typename AF>
kpeter@476:   class FilterArcs {
kpeter@474: #else
kpeter@476:   template<typename GR,
kpeter@476:            typename AF = typename GR::template ArcMap<bool> >
kpeter@476:   class FilterArcs :
kpeter@476:     public DigraphAdaptorExtender<
kpeter@476:       SubDigraphBase<GR, ConstMap<typename GR::Node, bool>, AF, false> > {
kpeter@474: #endif
deba@430:   public:
kpeter@476:     /// The type of the adapted digraph.
kpeter@476:     typedef GR Digraph;
kpeter@476:     /// The type of the arc filter map.
kpeter@476:     typedef AF ArcFilterMap;
kpeter@476: 
kpeter@476:     typedef DigraphAdaptorExtender<
kpeter@476:       SubDigraphBase<GR, ConstMap<typename GR::Node, bool>, AF, false> >
kpeter@476:       Parent;
deba@431: 
deba@431:     typedef typename Parent::Arc Arc;
deba@431: 
deba@430:   protected:
deba@430:     ConstMap<typename Digraph::Node, bool> const_true_map;
deba@430: 
deba@432:     FilterArcs() : const_true_map(true) {
deba@430:       Parent::setNodeFilterMap(const_true_map);
deba@430:     }
deba@430: 
deba@430:   public:
deba@430: 
deba@431:     /// \brief Constructor
deba@431:     ///
kpeter@474:     /// Creates a subdigraph for the given digraph with the given arc
kpeter@474:     /// filter map.
deba@432:     FilterArcs(Digraph& digraph, ArcFilterMap& arc_filter)
deba@432:       : Parent(), const_true_map(true) {
deba@430:       Parent::setDigraph(digraph);
deba@430:       Parent::setNodeFilterMap(const_true_map);
deba@430:       Parent::setArcFilterMap(arc_filter);
deba@430:     }
deba@430: 
kpeter@475:     /// \brief Sets the status of the given arc
deba@431:     ///
kpeter@475:     /// This function sets the status of the given arc.
kpeter@474:     /// It is done by simply setting the assigned value of \c a
kpeter@475:     /// to \c v in the arc filter map.
kpeter@475:     void status(const Arc& a, bool v) const { Parent::status(a, v); }
kpeter@475: 
kpeter@475:     /// \brief Returns the status of the given arc
deba@431:     ///
kpeter@475:     /// This function returns the status of the given arc.
kpeter@475:     /// It is \c true if the given arc is enabled (i.e. not hidden).
kpeter@475:     bool status(const Arc& a) const { return Parent::status(a); }
kpeter@475: 
kpeter@475:     /// \brief Disables the given arc
deba@431:     ///
kpeter@475:     /// This function disables the given arc in the subdigraph,
kpeter@475:     /// so the iteration jumps over it.
kpeter@475:     /// It is the same as \ref status() "status(a, false)".
kpeter@475:     void disable(const Arc& a) const { Parent::status(a, false); }
kpeter@475: 
kpeter@475:     /// \brief Enables the given arc
kpeter@475:     ///
kpeter@475:     /// This function enables the given arc in the subdigraph.
kpeter@475:     /// It is the same as \ref status() "status(a, true)".
kpeter@475:     void enable(const Arc& a) const { Parent::status(a, true); }
deba@431: 
deba@430:   };
deba@430: 
kpeter@474:   /// \brief Returns a read-only FilterArcs adaptor
deba@430:   ///
kpeter@474:   /// This function just returns a read-only \ref FilterArcs adaptor.
kpeter@474:   /// \ingroup graph_adaptors
kpeter@474:   /// \relates FilterArcs
kpeter@476:   template<typename GR, typename AF>
kpeter@476:   FilterArcs<const GR, AF>
kpeter@476:   filterArcs(const GR& digraph, AF& arc_filter_map) {
kpeter@476:     return FilterArcs<const GR, AF>(digraph, arc_filter_map);
deba@430:   }
deba@430: 
kpeter@476:   template<typename GR, typename AF>
kpeter@476:   FilterArcs<const GR, const AF>
kpeter@476:   filterArcs(const GR& digraph, const AF& arc_filter_map) {
kpeter@476:     return FilterArcs<const GR, const AF>(digraph, arc_filter_map);
deba@430:   }
deba@430: 
deba@432:   /// \ingroup graph_adaptors
deba@432:   ///
kpeter@474:   /// \brief Adaptor class for hiding edges in a graph.
deba@432:   ///
kpeter@474:   /// FilterEdges adaptor can be used for hiding edges in a graph.
kpeter@474:   /// A \c bool edge map must be specified, which defines the filter for
kpeter@474:   /// the edges. Only the edges with \c true filter value are shown in the
kpeter@474:   /// subgraph. This adaptor conforms to the \ref concepts::Graph
kpeter@474:   /// "Graph" concept.
deba@432:   ///
kpeter@474:   /// The adapted graph can also be modified through this adaptor
kpeter@476:   /// by adding or removing nodes or edges, unless the \c GR template
kpeter@474:   /// parameter is set to be \c const.
kpeter@474:   ///
kpeter@476:   /// \tparam GR The type of the adapted graph.
kpeter@474:   /// It must conform to the \ref concepts::Graph "Graph" concept.
kpeter@474:   /// It can also be specified to be \c const.
kpeter@476:   /// \tparam EF The type of the edge filter map.
kpeter@476:   /// It must be a \c bool (or convertible) edge map of the
kpeter@476:   /// adapted graph. The default type is
kpeter@476:   /// \ref concepts::Graph::EdgeMap "GR::EdgeMap<bool>".
kpeter@474:   ///
kpeter@474:   /// \note The \c Node, \c Edge and \c Arc types of this adaptor and the
kpeter@474:   /// adapted graph are convertible to each other.
kpeter@474: #ifdef DOXYGEN
kpeter@476:   template<typename GR,
kpeter@476:            typename EF>
kpeter@476:   class FilterEdges {
kpeter@474: #else
kpeter@476:   template<typename GR,
kpeter@476:            typename EF = typename GR::template EdgeMap<bool> >
kpeter@476:   class FilterEdges :
kpeter@476:     public GraphAdaptorExtender<
kpeter@476:       SubGraphBase<GR, ConstMap<typename GR::Node,bool>, EF, false> > {
kpeter@474: #endif
deba@432:   public:
kpeter@476:     /// The type of the adapted graph.
kpeter@476:     typedef GR Graph;
kpeter@476:     /// The type of the edge filter map.
kpeter@476:     typedef EF EdgeFilterMap;
kpeter@476: 
kpeter@476:     typedef GraphAdaptorExtender<
kpeter@476:       SubGraphBase<GR, ConstMap<typename GR::Node,bool>, EF, false> >
kpeter@476:       Parent;
kpeter@476: 
deba@432:     typedef typename Parent::Edge Edge;
kpeter@476: 
deba@432:   protected:
deba@432:     ConstMap<typename Graph::Node, bool> const_true_map;
deba@432: 
deba@432:     FilterEdges() : const_true_map(true) {
deba@432:       Parent::setNodeFilterMap(const_true_map);
deba@432:     }
deba@432: 
deba@432:   public:
deba@432: 
deba@432:     /// \brief Constructor
deba@432:     ///
kpeter@474:     /// Creates a subgraph for the given graph with the given edge
kpeter@474:     /// filter map.
kpeter@474:     FilterEdges(Graph& graph, EdgeFilterMap& edge_filter_map) :
deba@432:       Parent(), const_true_map(true) {
kpeter@474:       Parent::setGraph(graph);
deba@432:       Parent::setNodeFilterMap(const_true_map);
deba@432:       Parent::setEdgeFilterMap(edge_filter_map);
deba@432:     }
deba@432: 
kpeter@475:     /// \brief Sets the status of the given edge
deba@432:     ///
kpeter@475:     /// This function sets the status of the given edge.
kpeter@474:     /// It is done by simply setting the assigned value of \c e
kpeter@475:     /// to \c v in the edge filter map.
kpeter@475:     void status(const Edge& e, bool v) const { Parent::status(e, v); }
kpeter@475: 
kpeter@475:     /// \brief Returns the status of the given edge
deba@432:     ///
kpeter@475:     /// This function returns the status of the given edge.
kpeter@475:     /// It is \c true if the given edge is enabled (i.e. not hidden).
kpeter@475:     bool status(const Edge& e) const { return Parent::status(e); }
kpeter@475: 
kpeter@475:     /// \brief Disables the given edge
deba@432:     ///
kpeter@475:     /// This function disables the given edge in the subgraph,
kpeter@475:     /// so the iteration jumps over it.
kpeter@475:     /// It is the same as \ref status() "status(e, false)".
kpeter@475:     void disable(const Edge& e) const { Parent::status(e, false); }
kpeter@475: 
kpeter@475:     /// \brief Enables the given edge
kpeter@475:     ///
kpeter@475:     /// This function enables the given edge in the subgraph.
kpeter@475:     /// It is the same as \ref status() "status(e, true)".
kpeter@475:     void enable(const Edge& e) const { Parent::status(e, true); }
deba@432: 
deba@432:   };
deba@432: 
kpeter@474:   /// \brief Returns a read-only FilterEdges adaptor
deba@432:   ///
kpeter@474:   /// This function just returns a read-only \ref FilterEdges adaptor.
kpeter@474:   /// \ingroup graph_adaptors
kpeter@474:   /// \relates FilterEdges
kpeter@476:   template<typename GR, typename EF>
kpeter@476:   FilterEdges<const GR, EF>
kpeter@476:   filterEdges(const GR& graph, EF& edge_filter_map) {
kpeter@476:     return FilterEdges<const GR, EF>(graph, edge_filter_map);
deba@432:   }
deba@432: 
kpeter@476:   template<typename GR, typename EF>
kpeter@476:   FilterEdges<const GR, const EF>
kpeter@476:   filterEdges(const GR& graph, const EF& edge_filter_map) {
kpeter@476:     return FilterEdges<const GR, const EF>(graph, edge_filter_map);
deba@432:   }
deba@432: 
kpeter@474: 
deba@430:   template <typename _Digraph>
deba@432:   class UndirectorBase {
deba@430:   public:
deba@430:     typedef _Digraph Digraph;
deba@432:     typedef UndirectorBase Adaptor;
deba@430: 
deba@430:     typedef True UndirectedTag;
deba@430: 
deba@430:     typedef typename Digraph::Arc Edge;
deba@430:     typedef typename Digraph::Node Node;
deba@430: 
deba@430:     class Arc : public Edge {
deba@432:       friend class UndirectorBase;
deba@430:     protected:
deba@430:       bool _forward;
deba@430: 
deba@430:       Arc(const Edge& edge, bool forward) :
deba@430:         Edge(edge), _forward(forward) {}
deba@430: 
deba@430:     public:
deba@430:       Arc() {}
deba@430: 
deba@430:       Arc(Invalid) : Edge(INVALID), _forward(true) {}
deba@430: 
deba@430:       bool operator==(const Arc &other) const {
deba@432:         return _forward == other._forward &&
deba@432:           static_cast<const Edge&>(*this) == static_cast<const Edge&>(other);
deba@430:       }
deba@430:       bool operator!=(const Arc &other) const {
deba@432:         return _forward != other._forward ||
deba@432:           static_cast<const Edge&>(*this) != static_cast<const Edge&>(other);
deba@430:       }
deba@430:       bool operator<(const Arc &other) const {
deba@432:         return _forward < other._forward ||
deba@432:           (_forward == other._forward &&
deba@432:            static_cast<const Edge&>(*this) < static_cast<const Edge&>(other));
deba@430:       }
deba@430:     };
deba@430: 
deba@430:     void first(Node& n) const {
deba@430:       _digraph->first(n);
deba@430:     }
deba@430: 
deba@430:     void next(Node& n) const {
deba@430:       _digraph->next(n);
deba@430:     }
deba@430: 
deba@430:     void first(Arc& a) const {
deba@430:       _digraph->first(a);
deba@430:       a._forward = true;
deba@430:     }
deba@430: 
deba@430:     void next(Arc& a) const {
deba@430:       if (a._forward) {
deba@432:         a._forward = false;
deba@430:       } else {
deba@432:         _digraph->next(a);
deba@432:         a._forward = true;
deba@430:       }
deba@430:     }
deba@430: 
deba@430:     void first(Edge& e) const {
deba@430:       _digraph->first(e);
deba@430:     }
deba@430: 
deba@430:     void next(Edge& e) const {
deba@430:       _digraph->next(e);
deba@430:     }
deba@430: 
deba@430:     void firstOut(Arc& a, const Node& n) const {
deba@430:       _digraph->firstIn(a, n);
deba@430:       if( static_cast<const Edge&>(a) != INVALID ) {
deba@432:         a._forward = false;
deba@430:       } else {
deba@432:         _digraph->firstOut(a, n);
deba@432:         a._forward = true;
deba@430:       }
deba@430:     }
deba@430:     void nextOut(Arc &a) const {
deba@430:       if (!a._forward) {
deba@432:         Node n = _digraph->target(a);
deba@432:         _digraph->nextIn(a);
deba@432:         if (static_cast<const Edge&>(a) == INVALID ) {
deba@432:           _digraph->firstOut(a, n);
deba@432:           a._forward = true;
deba@432:         }
deba@430:       }
deba@430:       else {
deba@432:         _digraph->nextOut(a);
deba@430:       }
deba@430:     }
deba@430: 
deba@430:     void firstIn(Arc &a, const Node &n) const {
deba@430:       _digraph->firstOut(a, n);
deba@430:       if (static_cast<const Edge&>(a) != INVALID ) {
deba@432:         a._forward = false;
deba@430:       } else {
deba@432:         _digraph->firstIn(a, n);
deba@432:         a._forward = true;
deba@430:       }
deba@430:     }
deba@430:     void nextIn(Arc &a) const {
deba@430:       if (!a._forward) {
deba@432:         Node n = _digraph->source(a);
deba@432:         _digraph->nextOut(a);
deba@432:         if( static_cast<const Edge&>(a) == INVALID ) {
deba@432:           _digraph->firstIn(a, n);
deba@432:           a._forward = true;
deba@432:         }
deba@430:       }
deba@430:       else {
deba@432:         _digraph->nextIn(a);
deba@430:       }
deba@430:     }
deba@430: 
deba@430:     void firstInc(Edge &e, bool &d, const Node &n) const {
deba@430:       d = true;
deba@430:       _digraph->firstOut(e, n);
deba@430:       if (e != INVALID) return;
deba@430:       d = false;
deba@430:       _digraph->firstIn(e, n);
deba@430:     }
deba@430: 
deba@430:     void nextInc(Edge &e, bool &d) const {
deba@430:       if (d) {
deba@432:         Node s = _digraph->source(e);
deba@432:         _digraph->nextOut(e);
deba@432:         if (e != INVALID) return;
deba@432:         d = false;
deba@432:         _digraph->firstIn(e, s);
deba@430:       } else {
deba@432:         _digraph->nextIn(e);
deba@430:       }
deba@430:     }
deba@430: 
deba@430:     Node u(const Edge& e) const {
deba@430:       return _digraph->source(e);
deba@430:     }
deba@430: 
deba@430:     Node v(const Edge& e) const {
deba@430:       return _digraph->target(e);
deba@430:     }
deba@430: 
deba@430:     Node source(const Arc &a) const {
deba@430:       return a._forward ? _digraph->source(a) : _digraph->target(a);
deba@430:     }
deba@430: 
deba@430:     Node target(const Arc &a) const {
deba@430:       return a._forward ? _digraph->target(a) : _digraph->source(a);
deba@430:     }
deba@430: 
deba@430:     static Arc direct(const Edge &e, bool d) {
deba@430:       return Arc(e, d);
deba@430:     }
deba@430:     Arc direct(const Edge &e, const Node& n) const {
deba@430:       return Arc(e, _digraph->source(e) == n);
deba@430:     }
deba@430: 
deba@430:     static bool direction(const Arc &a) { return a._forward; }
deba@430: 
deba@430:     Node nodeFromId(int ix) const { return _digraph->nodeFromId(ix); }
deba@430:     Arc arcFromId(int ix) const {
deba@430:       return direct(_digraph->arcFromId(ix >> 1), bool(ix & 1));
deba@430:     }
deba@430:     Edge edgeFromId(int ix) const { return _digraph->arcFromId(ix); }
deba@430: 
deba@430:     int id(const Node &n) const { return _digraph->id(n); }
deba@430:     int id(const Arc &a) const {
deba@430:       return  (_digraph->id(a) << 1) | (a._forward ? 1 : 0);
deba@430:     }
deba@430:     int id(const Edge &e) const { return _digraph->id(e); }
deba@430: 
deba@430:     int maxNodeId() const { return _digraph->maxNodeId(); }
deba@430:     int maxArcId() const { return (_digraph->maxArcId() << 1) | 1; }
deba@430:     int maxEdgeId() const { return _digraph->maxArcId(); }
deba@430: 
deba@430:     Node addNode() { return _digraph->addNode(); }
deba@432:     Edge addEdge(const Node& u, const Node& v) {
deba@432:       return _digraph->addArc(u, v);
deba@430:     }
deba@430: 
deba@430:     void erase(const Node& i) { _digraph->erase(i); }
deba@430:     void erase(const Edge& i) { _digraph->erase(i); }
deba@432: 
deba@430:     void clear() { _digraph->clear(); }
deba@430: 
deba@430:     typedef NodeNumTagIndicator<Digraph> NodeNumTag;
kpeter@472:     int nodeNum() const { return _digraph->nodeNum(); }
kpeter@469: 
kpeter@469:     typedef ArcNumTagIndicator<Digraph> ArcNumTag;
deba@430:     int arcNum() const { return 2 * _digraph->arcNum(); }
kpeter@469: 
kpeter@469:     typedef ArcNumTag EdgeNumTag;
deba@430:     int edgeNum() const { return _digraph->arcNum(); }
deba@430: 
kpeter@469:     typedef FindArcTagIndicator<Digraph> FindArcTag;
deba@430:     Arc findArc(Node s, Node t, Arc p = INVALID) const {
deba@430:       if (p == INVALID) {
deba@432:         Edge arc = _digraph->findArc(s, t);
deba@432:         if (arc != INVALID) return direct(arc, true);
deba@432:         arc = _digraph->findArc(t, s);
deba@432:         if (arc != INVALID) return direct(arc, false);
deba@430:       } else if (direction(p)) {
deba@432:         Edge arc = _digraph->findArc(s, t, p);
deba@432:         if (arc != INVALID) return direct(arc, true);
deba@432:         arc = _digraph->findArc(t, s);
deba@432:         if (arc != INVALID) return direct(arc, false);
deba@430:       } else {
deba@432:         Edge arc = _digraph->findArc(t, s, p);
deba@432:         if (arc != INVALID) return direct(arc, false);
deba@430:       }
deba@430:       return INVALID;
deba@430:     }
deba@430: 
kpeter@469:     typedef FindArcTag FindEdgeTag;
deba@430:     Edge findEdge(Node s, Node t, Edge p = INVALID) const {
deba@430:       if (s != t) {
deba@430:         if (p == INVALID) {
deba@430:           Edge arc = _digraph->findArc(s, t);
deba@430:           if (arc != INVALID) return arc;
deba@430:           arc = _digraph->findArc(t, s);
deba@430:           if (arc != INVALID) return arc;
kpeter@472:         } else if (_digraph->source(p) == s) {
deba@430:           Edge arc = _digraph->findArc(s, t, p);
deba@430:           if (arc != INVALID) return arc;
deba@430:           arc = _digraph->findArc(t, s);
deba@432:           if (arc != INVALID) return arc;
deba@430:         } else {
deba@430:           Edge arc = _digraph->findArc(t, s, p);
deba@432:           if (arc != INVALID) return arc;
deba@430:         }
deba@430:       } else {
deba@430:         return _digraph->findArc(s, t, p);
deba@430:       }
deba@430:       return INVALID;
deba@430:     }
deba@430: 
deba@430:   private:
deba@432: 
deba@430:     template <typename _Value>
deba@430:     class ArcMapBase {
deba@430:     private:
deba@432: 
deba@430:       typedef typename Digraph::template ArcMap<_Value> MapImpl;
deba@432: 
deba@430:     public:
deba@430: 
deba@430:       typedef typename MapTraits<MapImpl>::ReferenceMapTag ReferenceMapTag;
deba@430: 
deba@430:       typedef _Value Value;
deba@430:       typedef Arc Key;
kpeter@472:       typedef typename MapTraits<MapImpl>::ConstReturnValue ConstReturnValue;
kpeter@472:       typedef typename MapTraits<MapImpl>::ReturnValue ReturnValue;
kpeter@472:       typedef typename MapTraits<MapImpl>::ConstReturnValue ConstReference;
kpeter@472:       typedef typename MapTraits<MapImpl>::ReturnValue Reference;
deba@432: 
deba@430:       ArcMapBase(const Adaptor& adaptor) :
deba@432:         _forward(*adaptor._digraph), _backward(*adaptor._digraph) {}
deba@432: 
deba@432:       ArcMapBase(const Adaptor& adaptor, const Value& v)
deba@430:         : _forward(*adaptor._digraph, v), _backward(*adaptor._digraph, v) {}
deba@432: 
deba@432:       void set(const Arc& a, const Value& v) {
deba@432:         if (direction(a)) {
deba@432:           _forward.set(a, v);
deba@432:         } else {
deba@432:           _backward.set(a, v);
deba@430:         }
deba@430:       }
deba@430: 
kpeter@472:       ConstReturnValue operator[](const Arc& a) const {
deba@432:         if (direction(a)) {
deba@432:           return _forward[a];
deba@432:         } else {
deba@432:           return _backward[a];
deba@430:         }
deba@430:       }
deba@430: 
kpeter@472:       ReturnValue operator[](const Arc& a) {
deba@432:         if (direction(a)) {
deba@432:           return _forward[a];
deba@432:         } else {
deba@432:           return _backward[a];
deba@432:         }
deba@432:       }
deba@432: 
deba@430:     protected:
deba@430: 
deba@432:       MapImpl _forward, _backward;
deba@430: 
deba@430:     };
deba@430: 
deba@430:   public:
deba@430: 
deba@430:     template <typename _Value>
deba@430:     class NodeMap : public Digraph::template NodeMap<_Value> {
deba@430:     public:
deba@430: 
deba@430:       typedef _Value Value;
deba@430:       typedef typename Digraph::template NodeMap<Value> Parent;
deba@430: 
deba@432:       explicit NodeMap(const Adaptor& adaptor)
deba@432:         : Parent(*adaptor._digraph) {}
deba@430: 
deba@430:       NodeMap(const Adaptor& adaptor, const _Value& value)
deba@432:         : Parent(*adaptor._digraph, value) { }
deba@430: 
deba@430:     private:
deba@430:       NodeMap& operator=(const NodeMap& cmap) {
deba@430:         return operator=<NodeMap>(cmap);
deba@430:       }
deba@430: 
deba@430:       template <typename CMap>
deba@430:       NodeMap& operator=(const CMap& cmap) {
deba@430:         Parent::operator=(cmap);
deba@430:         return *this;
deba@430:       }
deba@432: 
deba@430:     };
deba@430: 
deba@430:     template <typename _Value>
deba@432:     class ArcMap
deba@432:       : public SubMapExtender<Adaptor, ArcMapBase<_Value> >
deba@430:     {
deba@430:     public:
deba@430:       typedef _Value Value;
deba@430:       typedef SubMapExtender<Adaptor, ArcMapBase<Value> > Parent;
deba@432: 
kpeter@472:       explicit ArcMap(const Adaptor& adaptor)
deba@432:         : Parent(adaptor) {}
deba@432: 
deba@432:       ArcMap(const Adaptor& adaptor, const Value& value)
deba@432:         : Parent(adaptor, value) {}
deba@432: 
deba@430:     private:
deba@430:       ArcMap& operator=(const ArcMap& cmap) {
deba@432:         return operator=<ArcMap>(cmap);
deba@430:       }
deba@432: 
deba@430:       template <typename CMap>
deba@430:       ArcMap& operator=(const CMap& cmap) {
deba@430:         Parent::operator=(cmap);
deba@432:         return *this;
deba@430:       }
deba@430:     };
deba@432: 
deba@430:     template <typename _Value>
deba@430:     class EdgeMap : public Digraph::template ArcMap<_Value> {
deba@430:     public:
deba@432: 
deba@430:       typedef _Value Value;
deba@430:       typedef typename Digraph::template ArcMap<Value> Parent;
deba@432: 
deba@432:       explicit EdgeMap(const Adaptor& adaptor)
deba@432:         : Parent(*adaptor._digraph) {}
deba@430: 
deba@430:       EdgeMap(const Adaptor& adaptor, const Value& value)
deba@432:         : Parent(*adaptor._digraph, value) {}
deba@430: 
deba@430:     private:
deba@430:       EdgeMap& operator=(const EdgeMap& cmap) {
deba@430:         return operator=<EdgeMap>(cmap);
deba@430:       }
deba@430: 
deba@430:       template <typename CMap>
deba@430:       EdgeMap& operator=(const CMap& cmap) {
deba@430:         Parent::operator=(cmap);
deba@430:         return *this;
deba@430:       }
deba@430: 
deba@430:     };
deba@430: 
deba@430:     typedef typename ItemSetTraits<Digraph, Node>::ItemNotifier NodeNotifier;
deba@432:     NodeNotifier& notifier(Node) const { return _digraph->notifier(Node()); }
deba@430: 
kpeter@472:     typedef typename ItemSetTraits<Digraph, Edge>::ItemNotifier EdgeNotifier;
kpeter@472:     EdgeNotifier& notifier(Edge) const { return _digraph->notifier(Edge()); }
kpeter@472: 
deba@430:   protected:
deba@430: 
deba@432:     UndirectorBase() : _digraph(0) {}
deba@430: 
deba@430:     Digraph* _digraph;
deba@430: 
deba@430:     void setDigraph(Digraph& digraph) {
deba@430:       _digraph = &digraph;
deba@430:     }
deba@432: 
deba@430:   };
deba@430: 
deba@432:   /// \ingroup graph_adaptors
deba@430:   ///
kpeter@474:   /// \brief Adaptor class for viewing a digraph as an undirected graph.
deba@430:   ///
kpeter@474:   /// Undirector adaptor can be used for viewing a digraph as an undirected
kpeter@474:   /// graph. All arcs of the underlying digraph are showed in the
kpeter@474:   /// adaptor as an edge (and also as a pair of arcs, of course).
kpeter@474:   /// This adaptor conforms to the \ref concepts::Graph "Graph" concept.
deba@430:   ///
kpeter@474:   /// The adapted digraph can also be modified through this adaptor
kpeter@476:   /// by adding or removing nodes or edges, unless the \c GR template
kpeter@474:   /// parameter is set to be \c const.
kpeter@474:   ///
kpeter@476:   /// \tparam GR The type of the adapted digraph.
kpeter@474:   /// It must conform to the \ref concepts::Digraph "Digraph" concept.
kpeter@474:   /// It can also be specified to be \c const.
kpeter@474:   ///
kpeter@474:   /// \note The \c Node type of this adaptor and the adapted digraph are
kpeter@474:   /// convertible to each other, moreover the \c Edge type of the adaptor
kpeter@474:   /// and the \c Arc type of the adapted digraph are also convertible to
kpeter@474:   /// each other.
kpeter@474:   /// (Thus the \c Arc type of the adaptor is convertible to the \c Arc type
kpeter@474:   /// of the adapted digraph.)
kpeter@476:   template<typename GR>
kpeter@476: #ifdef DOXYGEN
kpeter@476:   class Undirector {
kpeter@476: #else
kpeter@476:   class Undirector :
kpeter@476:     public GraphAdaptorExtender<UndirectorBase<GR> > {
kpeter@476: #endif
deba@430:   public:
kpeter@476:     /// The type of the adapted digraph.
kpeter@476:     typedef GR Digraph;
kpeter@476:     typedef GraphAdaptorExtender<UndirectorBase<GR> > Parent;
deba@430:   protected:
deba@432:     Undirector() { }
deba@430:   public:
deba@430: 
deba@430:     /// \brief Constructor
deba@430:     ///
kpeter@474:     /// Creates an undirected graph from the given digraph.
kpeter@476:     Undirector(Digraph& digraph) {
deba@432:       setDigraph(digraph);
deba@430:     }
deba@430: 
kpeter@474:     /// \brief Arc map combined from two original arc maps
deba@430:     ///
kpeter@474:     /// This map adaptor class adapts two arc maps of the underlying
kpeter@474:     /// digraph to get an arc map of the undirected graph.
kpeter@474:     /// Its value type is inherited from the first arc map type
kpeter@474:     /// (\c %ForwardMap).
kpeter@476:     template <typename ForwardMap, typename BackwardMap>
deba@430:     class CombinedArcMap {
deba@430:     public:
deba@432: 
kpeter@474:       /// The key type of the map
kpeter@474:       typedef typename Parent::Arc Key;
kpeter@474:       /// The value type of the map
deba@430:       typedef typename ForwardMap::Value Value;
deba@430: 
kpeter@476:       typedef typename MapTraits<ForwardMap>::ReferenceMapTag ReferenceMapTag;
kpeter@476: 
kpeter@472:       typedef typename MapTraits<ForwardMap>::ReturnValue ReturnValue;
kpeter@472:       typedef typename MapTraits<ForwardMap>::ConstReturnValue ConstReturnValue;
kpeter@472:       typedef typename MapTraits<ForwardMap>::ReturnValue Reference;
kpeter@472:       typedef typename MapTraits<ForwardMap>::ConstReturnValue ConstReference;
kpeter@472: 
deba@432:       /// Constructor
deba@432:       CombinedArcMap(ForwardMap& forward, BackwardMap& backward)
deba@430:         : _forward(&forward), _backward(&backward) {}
deba@432: 
kpeter@474:       /// Sets the value associated with the given key.
deba@432:       void set(const Key& e, const Value& a) {
deba@432:         if (Parent::direction(e)) {
deba@432:           _forward->set(e, a);
deba@432:         } else {
deba@432:           _backward->set(e, a);
deba@432:         }
deba@430:       }
deba@430: 
kpeter@474:       /// Returns the value associated with the given key.
kpeter@472:       ConstReturnValue operator[](const Key& e) const {
deba@432:         if (Parent::direction(e)) {
deba@432:           return (*_forward)[e];
deba@432:         } else {
deba@432:           return (*_backward)[e];
deba@430:         }
deba@430:       }
deba@430: 
kpeter@474:       /// Returns a reference to the value associated with the given key.
kpeter@472:       ReturnValue operator[](const Key& e) {
deba@432:         if (Parent::direction(e)) {
deba@432:           return (*_forward)[e];
deba@432:         } else {
deba@432:           return (*_backward)[e];
deba@430:         }
deba@430:       }
deba@430: 
deba@432:     protected:
deba@432: 
deba@432:       ForwardMap* _forward;
deba@432:       BackwardMap* _backward;
deba@432: 
deba@432:     };
deba@432: 
kpeter@474:     /// \brief Returns a combined arc map
deba@432:     ///
kpeter@474:     /// This function just returns a combined arc map.
deba@432:     template <typename ForwardMap, typename BackwardMap>
deba@432:     static CombinedArcMap<ForwardMap, BackwardMap>
deba@432:     combinedArcMap(ForwardMap& forward, BackwardMap& backward) {
deba@432:       return CombinedArcMap<ForwardMap, BackwardMap>(forward, backward);
deba@432:     }
deba@432: 
deba@432:     template <typename ForwardMap, typename BackwardMap>
deba@432:     static CombinedArcMap<const ForwardMap, BackwardMap>
deba@432:     combinedArcMap(const ForwardMap& forward, BackwardMap& backward) {
deba@432:       return CombinedArcMap<const ForwardMap,
deba@432:         BackwardMap>(forward, backward);
deba@432:     }
deba@432: 
deba@432:     template <typename ForwardMap, typename BackwardMap>
deba@432:     static CombinedArcMap<ForwardMap, const BackwardMap>
deba@432:     combinedArcMap(ForwardMap& forward, const BackwardMap& backward) {
deba@432:       return CombinedArcMap<ForwardMap,
deba@432:         const BackwardMap>(forward, backward);
deba@432:     }
deba@432: 
deba@432:     template <typename ForwardMap, typename BackwardMap>
deba@432:     static CombinedArcMap<const ForwardMap, const BackwardMap>
deba@432:     combinedArcMap(const ForwardMap& forward, const BackwardMap& backward) {
deba@432:       return CombinedArcMap<const ForwardMap,
deba@432:         const BackwardMap>(forward, backward);
deba@432:     }
deba@432: 
deba@432:   };
deba@432: 
kpeter@474:   /// \brief Returns a read-only Undirector adaptor
deba@432:   ///
kpeter@474:   /// This function just returns a read-only \ref Undirector adaptor.
kpeter@474:   /// \ingroup graph_adaptors
kpeter@474:   /// \relates Undirector
kpeter@476:   template<typename GR>
kpeter@476:   Undirector<const GR> undirector(const GR& digraph) {
kpeter@476:     return Undirector<const GR>(digraph);
deba@432:   }
deba@432: 
kpeter@474: 
deba@432:   template <typename _Graph, typename _DirectionMap>
deba@432:   class OrienterBase {
deba@432:   public:
deba@432: 
deba@432:     typedef _Graph Graph;
deba@432:     typedef _DirectionMap DirectionMap;
deba@432: 
deba@432:     typedef typename Graph::Node Node;
deba@432:     typedef typename Graph::Edge Arc;
deba@432: 
deba@432:     void reverseArc(const Arc& arc) {
deba@432:       _direction->set(arc, !(*_direction)[arc]);
deba@432:     }
deba@432: 
deba@432:     void first(Node& i) const { _graph->first(i); }
deba@432:     void first(Arc& i) const { _graph->first(i); }
deba@432:     void firstIn(Arc& i, const Node& n) const {
kpeter@470:       bool d = true;
deba@432:       _graph->firstInc(i, d, n);
deba@432:       while (i != INVALID && d == (*_direction)[i]) _graph->nextInc(i, d);
deba@432:     }
deba@432:     void firstOut(Arc& i, const Node& n ) const {
kpeter@470:       bool d = true;
deba@432:       _graph->firstInc(i, d, n);
deba@432:       while (i != INVALID && d != (*_direction)[i]) _graph->nextInc(i, d);
deba@432:     }
deba@432: 
deba@432:     void next(Node& i) const { _graph->next(i); }
deba@432:     void next(Arc& i) const { _graph->next(i); }
deba@432:     void nextIn(Arc& i) const {
deba@432:       bool d = !(*_direction)[i];
deba@432:       _graph->nextInc(i, d);
deba@432:       while (i != INVALID && d == (*_direction)[i]) _graph->nextInc(i, d);
deba@432:     }
deba@432:     void nextOut(Arc& i) const {
deba@432:       bool d = (*_direction)[i];
deba@432:       _graph->nextInc(i, d);
deba@432:       while (i != INVALID && d != (*_direction)[i]) _graph->nextInc(i, d);
deba@432:     }
deba@432: 
deba@432:     Node source(const Arc& e) const {
deba@432:       return (*_direction)[e] ? _graph->u(e) : _graph->v(e);
deba@432:     }
deba@432:     Node target(const Arc& e) const {
deba@432:       return (*_direction)[e] ? _graph->v(e) : _graph->u(e);
deba@432:     }
deba@432: 
deba@432:     typedef NodeNumTagIndicator<Graph> NodeNumTag;
deba@432:     int nodeNum() const { return _graph->nodeNum(); }
deba@432: 
kpeter@469:     typedef EdgeNumTagIndicator<Graph> ArcNumTag;
deba@432:     int arcNum() const { return _graph->edgeNum(); }
deba@432: 
kpeter@469:     typedef FindEdgeTagIndicator<Graph> FindArcTag;
deba@432:     Arc findArc(const Node& u, const Node& v,
kpeter@471:                 const Arc& prev = INVALID) const {
kpeter@472:       Arc arc = _graph->findEdge(u, v, prev);
kpeter@472:       while (arc != INVALID && source(arc) != u) {
deba@432:         arc = _graph->findEdge(u, v, arc);
deba@430:       }
deba@432:       return arc;
deba@432:     }
deba@432: 
deba@432:     Node addNode() {
deba@432:       return Node(_graph->addNode());
deba@432:     }
deba@432: 
deba@432:     Arc addArc(const Node& u, const Node& v) {
kpeter@472:       Arc arc = _graph->addEdge(u, v);
kpeter@472:       _direction->set(arc, _graph->u(arc) == u);
deba@432:       return arc;
deba@432:     }
deba@432: 
deba@432:     void erase(const Node& i) { _graph->erase(i); }
deba@432:     void erase(const Arc& i) { _graph->erase(i); }
deba@432: 
deba@432:     void clear() { _graph->clear(); }
deba@432: 
deba@432:     int id(const Node& v) const { return _graph->id(v); }
deba@432:     int id(const Arc& e) const { return _graph->id(e); }
deba@432: 
deba@432:     Node nodeFromId(int idx) const { return _graph->nodeFromId(idx); }
deba@432:     Arc arcFromId(int idx) const { return _graph->edgeFromId(idx); }
deba@432: 
deba@432:     int maxNodeId() const { return _graph->maxNodeId(); }
deba@432:     int maxArcId() const { return _graph->maxEdgeId(); }
deba@432: 
deba@432:     typedef typename ItemSetTraits<Graph, Node>::ItemNotifier NodeNotifier;
deba@432:     NodeNotifier& notifier(Node) const { return _graph->notifier(Node()); }
deba@432: 
deba@432:     typedef typename ItemSetTraits<Graph, Arc>::ItemNotifier ArcNotifier;
deba@432:     ArcNotifier& notifier(Arc) const { return _graph->notifier(Arc()); }
deba@432: 
deba@432:     template <typename _Value>
deba@432:     class NodeMap : public _Graph::template NodeMap<_Value> {
deba@432:     public:
deba@432: 
deba@432:       typedef typename _Graph::template NodeMap<_Value> Parent;
deba@432: 
deba@432:       explicit NodeMap(const OrienterBase& adapter)
deba@432:         : Parent(*adapter._graph) {}
deba@432: 
deba@432:       NodeMap(const OrienterBase& adapter, const _Value& value)
deba@432:         : Parent(*adapter._graph, value) {}
deba@432: 
deba@432:     private:
deba@432:       NodeMap& operator=(const NodeMap& cmap) {
deba@432:         return operator=<NodeMap>(cmap);
deba@432:       }
deba@432: 
deba@432:       template <typename CMap>
deba@432:       NodeMap& operator=(const CMap& cmap) {
deba@432:         Parent::operator=(cmap);
deba@432:         return *this;
deba@432:       }
deba@430: 
deba@430:     };
deba@430: 
deba@432:     template <typename _Value>
deba@432:     class ArcMap : public _Graph::template EdgeMap<_Value> {
deba@432:     public:
deba@432: 
deba@432:       typedef typename Graph::template EdgeMap<_Value> Parent;
deba@432: 
deba@432:       explicit ArcMap(const OrienterBase& adapter)
deba@432:         : Parent(*adapter._graph) { }
deba@432: 
deba@432:       ArcMap(const OrienterBase& adapter, const _Value& value)
deba@432:         : Parent(*adapter._graph, value) { }
deba@432: 
deba@432:     private:
deba@432:       ArcMap& operator=(const ArcMap& cmap) {
deba@432:         return operator=<ArcMap>(cmap);
deba@432:       }
deba@432: 
deba@432:       template <typename CMap>
deba@432:       ArcMap& operator=(const CMap& cmap) {
deba@432:         Parent::operator=(cmap);
deba@432:         return *this;
deba@432:       }
deba@432:     };
deba@432: 
deba@432: 
deba@432: 
deba@432:   protected:
deba@432:     Graph* _graph;
deba@432:     DirectionMap* _direction;
deba@432: 
deba@432:     void setDirectionMap(DirectionMap& direction) {
deba@432:       _direction = &direction;
deba@432:     }
deba@432: 
deba@432:     void setGraph(Graph& graph) {
deba@432:       _graph = &graph;
deba@432:     }
deba@432: 
deba@430:   };
deba@430: 
deba@432:   /// \ingroup graph_adaptors
deba@430:   ///
kpeter@474:   /// \brief Adaptor class for orienting the edges of a graph to get a digraph
deba@432:   ///
kpeter@474:   /// Orienter adaptor can be used for orienting the edges of a graph to
kpeter@474:   /// get a digraph. A \c bool edge map of the underlying graph must be
kpeter@474:   /// specified, which define the direction of the arcs in the adaptor.
kpeter@474:   /// The arcs can be easily reversed by the \c reverseArc() member function
kpeter@474:   /// of the adaptor.
kpeter@474:   /// This class conforms to the \ref concepts::Digraph "Digraph" concept.
deba@432:   ///
kpeter@474:   /// The adapted graph can also be modified through this adaptor
kpeter@476:   /// by adding or removing nodes or arcs, unless the \c GR template
kpeter@474:   /// parameter is set to be \c const.
deba@432:   ///
kpeter@476:   /// \tparam GR The type of the adapted graph.
kpeter@474:   /// It must conform to the \ref concepts::Graph "Graph" concept.
kpeter@474:   /// It can also be specified to be \c const.
kpeter@476:   /// \tparam DM The type of the direction map.
kpeter@476:   /// It must be a \c bool (or convertible) edge map of the
kpeter@476:   /// adapted graph. The default type is
kpeter@476:   /// \ref concepts::Graph::EdgeMap "GR::EdgeMap<bool>".
kpeter@474:   ///
kpeter@474:   /// \note The \c Node type of this adaptor and the adapted graph are
kpeter@474:   /// convertible to each other, moreover the \c Arc type of the adaptor
kpeter@474:   /// and the \c Edge type of the adapted graph are also convertible to
kpeter@474:   /// each other.
kpeter@474: #ifdef DOXYGEN
kpeter@476:   template<typename GR,
kpeter@476:            typename DM>
kpeter@476:   class Orienter {
kpeter@474: #else
kpeter@476:   template<typename GR,
kpeter@476:            typename DM = typename GR::template EdgeMap<bool> >
kpeter@476:   class Orienter :
kpeter@476:     public DigraphAdaptorExtender<OrienterBase<GR, DM> > {
kpeter@474: #endif
deba@432:   public:
kpeter@474: 
kpeter@474:     /// The type of the adapted graph.
kpeter@476:     typedef GR Graph;
kpeter@474:     /// The type of the direction edge map.
kpeter@476:     typedef DM DirectionMap;
kpeter@476: 
kpeter@476:     typedef DigraphAdaptorExtender<OrienterBase<GR, DM> > Parent;
deba@432:     typedef typename Parent::Arc Arc;
deba@432:   protected:
deba@432:     Orienter() { }
deba@432:   public:
deba@432: 
kpeter@474:     /// \brief Constructor
deba@432:     ///
kpeter@474:     /// Constructor of the adaptor.
deba@432:     Orienter(Graph& graph, DirectionMap& direction) {
deba@432:       setGraph(graph);
deba@432:       setDirectionMap(direction);
deba@432:     }
deba@432: 
kpeter@474:     /// \brief Reverses the given arc
deba@432:     ///
kpeter@474:     /// This function reverses the given arc.
kpeter@474:     /// It is done by simply negate the assigned value of \c a
kpeter@474:     /// in the direction map.
deba@432:     void reverseArc(const Arc& a) {
deba@432:       Parent::reverseArc(a);
deba@432:     }
deba@432:   };
deba@432: 
kpeter@474:   /// \brief Returns a read-only Orienter adaptor
deba@432:   ///
kpeter@474:   /// This function just returns a read-only \ref Orienter adaptor.
kpeter@474:   /// \ingroup graph_adaptors
kpeter@474:   /// \relates Orienter
kpeter@476:   template<typename GR, typename DM>
kpeter@476:   Orienter<const GR, DM>
kpeter@476:   orienter(const GR& graph, DM& direction_map) {
kpeter@476:     return Orienter<const GR, DM>(graph, direction_map);
deba@430:   }
deba@430: 
kpeter@476:   template<typename GR, typename DM>
kpeter@476:   Orienter<const GR, const DM>
kpeter@476:   orienter(const GR& graph, const DM& direction_map) {
kpeter@476:     return Orienter<const GR, const DM>(graph, direction_map);
deba@432:   }
deba@432: 
deba@432:   namespace _adaptor_bits {
deba@432: 
kpeter@476:     template<typename Digraph,
kpeter@476:              typename CapacityMap,
kpeter@476:              typename FlowMap,
kpeter@476:              typename Tolerance>
deba@432:     class ResForwardFilter {
deba@432:     public:
deba@432: 
deba@432:       typedef typename Digraph::Arc Key;
deba@432:       typedef bool Value;
deba@432: 
deba@432:     private:
deba@432: 
deba@432:       const CapacityMap* _capacity;
deba@432:       const FlowMap* _flow;
deba@432:       Tolerance _tolerance;
deba@432:     public:
deba@432: 
deba@432:       ResForwardFilter(const CapacityMap& capacity, const FlowMap& flow,
deba@432:                        const Tolerance& tolerance = Tolerance())
deba@432:         : _capacity(&capacity), _flow(&flow), _tolerance(tolerance) { }
deba@432: 
deba@432:       bool operator[](const typename Digraph::Arc& a) const {
deba@432:         return _tolerance.positive((*_capacity)[a] - (*_flow)[a]);
deba@432:       }
deba@432:     };
deba@432: 
kpeter@476:     template<typename Digraph,
kpeter@476:              typename CapacityMap,
kpeter@476:              typename FlowMap,
kpeter@476:              typename Tolerance>
deba@432:     class ResBackwardFilter {
deba@432:     public:
deba@432: 
deba@432:       typedef typename Digraph::Arc Key;
deba@432:       typedef bool Value;
deba@432: 
deba@432:     private:
deba@432: 
deba@432:       const CapacityMap* _capacity;
deba@432:       const FlowMap* _flow;
deba@432:       Tolerance _tolerance;
deba@432: 
deba@432:     public:
deba@432: 
deba@432:       ResBackwardFilter(const CapacityMap& capacity, const FlowMap& flow,
deba@432:                         const Tolerance& tolerance = Tolerance())
deba@432:         : _capacity(&capacity), _flow(&flow), _tolerance(tolerance) { }
deba@432: 
deba@432:       bool operator[](const typename Digraph::Arc& a) const {
deba@432:         return _tolerance.positive((*_flow)[a]);
deba@432:       }
deba@432:     };
deba@432: 
deba@432:   }
deba@432: 
deba@432:   /// \ingroup graph_adaptors
deba@432:   ///
kpeter@474:   /// \brief Adaptor class for composing the residual digraph for directed
deba@432:   /// flow and circulation problems.
deba@432:   ///
kpeter@487:   /// ResidualDigraph can be used for composing the \e residual digraph
kpeter@487:   /// for directed flow and circulation problems. Let \f$ G=(V, A) \f$
kpeter@487:   /// be a directed graph and let \f$ F \f$ be a number type.
kpeter@487:   /// Let \f$ flow, cap: A\to F \f$ be functions on the arcs.
kpeter@474:   /// This adaptor implements a digraph structure with node set \f$ V \f$
kpeter@474:   /// and arc set \f$ A_{forward}\cup A_{backward} \f$,
kpeter@474:   /// where \f$ A_{forward}=\{uv : uv\in A, flow(uv)<cap(uv)\} \f$ and
kpeter@474:   /// \f$ A_{backward}=\{vu : uv\in A, flow(uv)>0\} \f$, i.e. the so
kpeter@474:   /// called residual digraph.
kpeter@474:   /// When the union \f$ A_{forward}\cup A_{backward} \f$ is taken,
kpeter@474:   /// multiplicities are counted, i.e. the adaptor has exactly
kpeter@474:   /// \f$ |A_{forward}| + |A_{backward}|\f$ arcs (it may have parallel
kpeter@474:   /// arcs).
kpeter@474:   /// This class conforms to the \ref concepts::Digraph "Digraph" concept.
deba@432:   ///
kpeter@476:   /// \tparam GR The type of the adapted digraph.
kpeter@474:   /// It must conform to the \ref concepts::Digraph "Digraph" concept.
kpeter@474:   /// It is implicitly \c const.
kpeter@476:   /// \tparam CM The type of the capacity map.
kpeter@476:   /// It must be an arc map of some numerical type, which defines
kpeter@474:   /// the capacities in the flow problem. It is implicitly \c const.
kpeter@476:   /// The default type is
kpeter@476:   /// \ref concepts::Digraph::ArcMap "GR::ArcMap<int>".
kpeter@476:   /// \tparam FM The type of the flow map.
kpeter@476:   /// It must be an arc map of some numerical type, which defines
kpeter@476:   /// the flow values in the flow problem. The default type is \c CM.
kpeter@476:   /// \tparam TL The tolerance type for handling inexact computation.
kpeter@474:   /// The default tolerance type depends on the value type of the
kpeter@474:   /// capacity map.
deba@432:   ///
kpeter@474:   /// \note This adaptor is implemented using Undirector and FilterArcs
kpeter@474:   /// adaptors.
kpeter@474:   ///
kpeter@474:   /// \note The \c Node type of this adaptor and the adapted digraph are
kpeter@474:   /// convertible to each other, moreover the \c Arc type of the adaptor
kpeter@474:   /// is convertible to the \c Arc type of the adapted digraph.
kpeter@474: #ifdef DOXYGEN
kpeter@476:   template<typename GR, typename CM, typename FM, typename TL>
kpeter@487:   class ResidualDigraph
kpeter@474: #else
kpeter@476:   template<typename GR,
kpeter@476:            typename CM = typename GR::template ArcMap<int>,
kpeter@476:            typename FM = CM,
kpeter@476:            typename TL = Tolerance<typename CM::Value> >
kpeter@487:   class ResidualDigraph :
deba@432:     public FilterArcs<
kpeter@476:       Undirector<const GR>,
kpeter@476:       typename Undirector<const GR>::template CombinedArcMap<
kpeter@476:         _adaptor_bits::ResForwardFilter<const GR, CM, FM, TL>,
kpeter@476:         _adaptor_bits::ResBackwardFilter<const GR, CM, FM, TL> > >
kpeter@474: #endif
deba@432:   {
deba@430:   public:
deba@430: 
kpeter@474:     /// The type of the underlying digraph.
kpeter@476:     typedef GR Digraph;
kpeter@474:     /// The type of the capacity map.
kpeter@476:     typedef CM CapacityMap;
kpeter@474:     /// The type of the flow map.
kpeter@476:     typedef FM FlowMap;
kpeter@476:     /// The tolerance type.
kpeter@476:     typedef TL Tolerance;
deba@430: 
deba@430:     typedef typename CapacityMap::Value Value;
kpeter@487:     typedef ResidualDigraph Adaptor;
deba@430: 
deba@430:   protected:
deba@430: 
deba@432:     typedef Undirector<const Digraph> Undirected;
deba@432: 
deba@432:     typedef _adaptor_bits::ResForwardFilter<const Digraph, CapacityMap,
deba@432:                                             FlowMap, Tolerance> ForwardFilter;
deba@432: 
deba@432:     typedef _adaptor_bits::ResBackwardFilter<const Digraph, CapacityMap,
deba@432:                                              FlowMap, Tolerance> BackwardFilter;
deba@432: 
deba@432:     typedef typename Undirected::
kpeter@476:       template CombinedArcMap<ForwardFilter, BackwardFilter> ArcFilter;
deba@430: 
deba@432:     typedef FilterArcs<Undirected, ArcFilter> Parent;
deba@430: 
deba@430:     const CapacityMap* _capacity;
deba@430:     FlowMap* _flow;
deba@430: 
deba@432:     Undirected _graph;
deba@430:     ForwardFilter _forward_filter;
deba@430:     BackwardFilter _backward_filter;
deba@430:     ArcFilter _arc_filter;
deba@430: 
deba@430:   public:
deba@430: 
kpeter@474:     /// \brief Constructor
deba@430:     ///
kpeter@474:     /// Constructor of the residual digraph adaptor. The parameters are the
kpeter@474:     /// digraph, the capacity map, the flow map, and a tolerance object.
kpeter@487:     ResidualDigraph(const Digraph& digraph, const CapacityMap& capacity,
kpeter@487:                     FlowMap& flow, const Tolerance& tolerance = Tolerance())
deba@430:       : Parent(), _capacity(&capacity), _flow(&flow), _graph(digraph),
deba@432:         _forward_filter(capacity, flow, tolerance),
deba@430:         _backward_filter(capacity, flow, tolerance),
deba@430:         _arc_filter(_forward_filter, _backward_filter)
deba@430:     {
deba@430:       Parent::setDigraph(_graph);
deba@430:       Parent::setArcFilterMap(_arc_filter);
deba@430:     }
deba@430: 
deba@430:     typedef typename Parent::Arc Arc;
deba@430: 
kpeter@474:     /// \brief Returns the residual capacity of the given arc.
deba@430:     ///
kpeter@474:     /// Returns the residual capacity of the given arc.
deba@432:     Value residualCapacity(const Arc& a) const {
deba@432:       if (Undirected::direction(a)) {
deba@432:         return (*_capacity)[a] - (*_flow)[a];
deba@430:       } else {
deba@432:         return (*_flow)[a];
deba@430:       }
deba@432:     }
deba@432: 
kpeter@475:     /// \brief Augments on the given arc in the residual digraph.
deba@430:     ///
kpeter@475:     /// Augments on the given arc in the residual digraph. It increases
kpeter@474:     /// or decreases the flow value on the original arc according to the
kpeter@474:     /// direction of the residual arc.
deba@432:     void augment(const Arc& a, const Value& v) const {
deba@432:       if (Undirected::direction(a)) {
deba@432:         _flow->set(a, (*_flow)[a] + v);
deba@432:       } else {
deba@432:         _flow->set(a, (*_flow)[a] - v);
deba@430:       }
deba@430:     }
deba@430: 
kpeter@474:     /// \brief Returns \c true if the given residual arc is a forward arc.
deba@430:     ///
kpeter@474:     /// Returns \c true if the given residual arc has the same orientation
kpeter@474:     /// as the original arc, i.e. it is a so called forward arc.
deba@432:     static bool forward(const Arc& a) {
deba@432:       return Undirected::direction(a);
deba@430:     }
deba@430: 
kpeter@474:     /// \brief Returns \c true if the given residual arc is a backward arc.
deba@430:     ///
kpeter@474:     /// Returns \c true if the given residual arc has the opposite orientation
kpeter@474:     /// than the original arc, i.e. it is a so called backward arc.
deba@432:     static bool backward(const Arc& a) {
deba@432:       return !Undirected::direction(a);
deba@430:     }
deba@430: 
kpeter@474:     /// \brief Returns the forward oriented residual arc.
deba@430:     ///
kpeter@474:     /// Returns the forward oriented residual arc related to the given
kpeter@474:     /// arc of the underlying digraph.
deba@432:     static Arc forward(const typename Digraph::Arc& a) {
deba@432:       return Undirected::direct(a, true);
deba@430:     }
deba@430: 
kpeter@474:     /// \brief Returns the backward oriented residual arc.
deba@430:     ///
kpeter@474:     /// Returns the backward oriented residual arc related to the given
kpeter@474:     /// arc of the underlying digraph.
deba@432:     static Arc backward(const typename Digraph::Arc& a) {
deba@432:       return Undirected::direct(a, false);
deba@430:     }
deba@430: 
deba@430:     /// \brief Residual capacity map.
deba@430:     ///
kpeter@474:     /// This map adaptor class can be used for obtaining the residual
kpeter@474:     /// capacities as an arc map of the residual digraph.
kpeter@474:     /// Its value type is inherited from the capacity map.
deba@432:     class ResidualCapacity {
deba@430:     protected:
deba@430:       const Adaptor* _adaptor;
deba@430:     public:
kpeter@474:       /// The key type of the map
deba@430:       typedef Arc Key;
kpeter@474:       /// The value type of the map
kpeter@476:       typedef typename CapacityMap::Value Value;
deba@430: 
deba@432:       /// Constructor
deba@432:       ResidualCapacity(const Adaptor& adaptor) : _adaptor(&adaptor) {}
deba@432: 
kpeter@474:       /// Returns the value associated with the given residual arc
deba@432:       Value operator[](const Arc& a) const {
deba@432:         return _adaptor->residualCapacity(a);
deba@430:       }
deba@432: 
deba@430:     };
deba@430: 
kpeter@473:     /// \brief Returns a residual capacity map
kpeter@473:     ///
kpeter@473:     /// This function just returns a residual capacity map.
kpeter@473:     ResidualCapacity residualCapacity() const {
kpeter@473:       return ResidualCapacity(*this);
kpeter@473:     }
kpeter@473: 
deba@430:   };
deba@430: 
kpeter@473:   /// \brief Returns a (read-only) Residual adaptor
kpeter@473:   ///
kpeter@473:   /// This function just returns a (read-only) \ref Residual adaptor.
kpeter@473:   /// \ingroup graph_adaptors
kpeter@473:   /// \relates Residual
kpeter@476:   template<typename GR, typename CM, typename FM>
kpeter@487:   ResidualDigraph<GR, CM, FM>
kpeter@487:   residualDigraph(const GR& digraph, const CM& capacity_map, FM& flow_map) {
kpeter@487:     return ResidualDigraph<GR, CM, FM> (digraph, capacity_map, flow_map);
kpeter@473:   }
kpeter@473: 
kpeter@473: 
deba@430:   template <typename _Digraph>
deba@432:   class SplitNodesBase {
deba@430:   public:
deba@430: 
deba@430:     typedef _Digraph Digraph;
deba@430:     typedef DigraphAdaptorBase<const _Digraph> Parent;
deba@432:     typedef SplitNodesBase Adaptor;
deba@430: 
deba@430:     typedef typename Digraph::Node DigraphNode;
deba@430:     typedef typename Digraph::Arc DigraphArc;
deba@430: 
deba@430:     class Node;
deba@430:     class Arc;
deba@430: 
deba@430:   private:
deba@430: 
deba@430:     template <typename T> class NodeMapBase;
deba@430:     template <typename T> class ArcMapBase;
deba@430: 
deba@430:   public:
deba@432: 
deba@430:     class Node : public DigraphNode {
deba@432:       friend class SplitNodesBase;
deba@430:       template <typename T> friend class NodeMapBase;
deba@430:     private:
deba@430: 
deba@430:       bool _in;
deba@430:       Node(DigraphNode node, bool in)
deba@432:         : DigraphNode(node), _in(in) {}
deba@432: 
deba@430:     public:
deba@430: 
deba@430:       Node() {}
deba@430:       Node(Invalid) : DigraphNode(INVALID), _in(true) {}
deba@430: 
deba@430:       bool operator==(const Node& node) const {
deba@432:         return DigraphNode::operator==(node) && _in == node._in;
deba@430:       }
deba@432: 
deba@430:       bool operator!=(const Node& node) const {
deba@432:         return !(*this == node);
deba@430:       }
deba@432: 
deba@430:       bool operator<(const Node& node) const {
deba@432:         return DigraphNode::operator<(node) ||
deba@432:           (DigraphNode::operator==(node) && _in < node._in);
deba@430:       }
deba@430:     };
deba@430: 
deba@430:     class Arc {
deba@432:       friend class SplitNodesBase;
deba@430:       template <typename T> friend class ArcMapBase;
deba@430:     private:
deba@430:       typedef BiVariant<DigraphArc, DigraphNode> ArcImpl;
deba@430: 
deba@430:       explicit Arc(const DigraphArc& arc) : _item(arc) {}
deba@430:       explicit Arc(const DigraphNode& node) : _item(node) {}
deba@432: 
deba@430:       ArcImpl _item;
deba@430: 
deba@430:     public:
deba@430:       Arc() {}
deba@430:       Arc(Invalid) : _item(DigraphArc(INVALID)) {}
deba@430: 
deba@430:       bool operator==(const Arc& arc) const {
deba@430:         if (_item.firstState()) {
deba@430:           if (arc._item.firstState()) {
deba@430:             return _item.first() == arc._item.first();
deba@430:           }
deba@430:         } else {
deba@430:           if (arc._item.secondState()) {
deba@430:             return _item.second() == arc._item.second();
deba@430:           }
deba@430:         }
deba@430:         return false;
deba@430:       }
deba@432: 
deba@430:       bool operator!=(const Arc& arc) const {
deba@432:         return !(*this == arc);
deba@430:       }
deba@432: 
deba@430:       bool operator<(const Arc& arc) const {
deba@430:         if (_item.firstState()) {
deba@430:           if (arc._item.firstState()) {
deba@430:             return _item.first() < arc._item.first();
deba@430:           }
deba@430:           return false;
deba@430:         } else {
deba@430:           if (arc._item.secondState()) {
deba@430:             return _item.second() < arc._item.second();
deba@430:           }
deba@430:           return true;
deba@430:         }
deba@430:       }
deba@430: 
deba@430:       operator DigraphArc() const { return _item.first(); }
deba@430:       operator DigraphNode() const { return _item.second(); }
deba@430: 
deba@430:     };
deba@430: 
deba@430:     void first(Node& n) const {
deba@430:       _digraph->first(n);
deba@430:       n._in = true;
deba@430:     }
deba@430: 
deba@430:     void next(Node& n) const {
deba@430:       if (n._in) {
deba@432:         n._in = false;
deba@430:       } else {
deba@432:         n._in = true;
deba@432:         _digraph->next(n);
deba@430:       }
deba@430:     }
deba@430: 
deba@430:     void first(Arc& e) const {
deba@430:       e._item.setSecond();
deba@430:       _digraph->first(e._item.second());
deba@430:       if (e._item.second() == INVALID) {
deba@430:         e._item.setFirst();
deba@432:         _digraph->first(e._item.first());
deba@430:       }
deba@430:     }
deba@430: 
deba@430:     void next(Arc& e) const {
deba@430:       if (e._item.secondState()) {
deba@432:         _digraph->next(e._item.second());
deba@430:         if (e._item.second() == INVALID) {
deba@430:           e._item.setFirst();
deba@430:           _digraph->first(e._item.first());
deba@430:         }
deba@430:       } else {
deba@432:         _digraph->next(e._item.first());
deba@432:       }
deba@430:     }
deba@430: 
deba@430:     void firstOut(Arc& e, const Node& n) const {
deba@430:       if (n._in) {
deba@430:         e._item.setSecond(n);
deba@430:       } else {
deba@430:         e._item.setFirst();
deba@432:         _digraph->firstOut(e._item.first(), n);
deba@430:       }
deba@430:     }
deba@430: 
deba@430:     void nextOut(Arc& e) const {
deba@430:       if (!e._item.firstState()) {
deba@432:         e._item.setFirst(INVALID);
deba@430:       } else {
deba@432:         _digraph->nextOut(e._item.first());
deba@432:       }
deba@430:     }
deba@430: 
deba@430:     void firstIn(Arc& e, const Node& n) const {
deba@430:       if (!n._in) {
deba@432:         e._item.setSecond(n);
deba@430:       } else {
deba@430:         e._item.setFirst();
deba@432:         _digraph->firstIn(e._item.first(), n);
deba@430:       }
deba@430:     }
deba@430: 
deba@430:     void nextIn(Arc& e) const {
deba@430:       if (!e._item.firstState()) {
deba@432:         e._item.setFirst(INVALID);
deba@430:       } else {
deba@432:         _digraph->nextIn(e._item.first());
deba@430:       }
deba@430:     }
deba@430: 
deba@430:     Node source(const Arc& e) const {
deba@430:       if (e._item.firstState()) {
deba@432:         return Node(_digraph->source(e._item.first()), false);
deba@430:       } else {
deba@432:         return Node(e._item.second(), true);
deba@430:       }
deba@430:     }
deba@430: 
deba@430:     Node target(const Arc& e) const {
deba@430:       if (e._item.firstState()) {
deba@432:         return Node(_digraph->target(e._item.first()), true);
deba@430:       } else {
deba@432:         return Node(e._item.second(), false);
deba@430:       }
deba@430:     }
deba@430: 
deba@430:     int id(const Node& n) const {
deba@430:       return (_digraph->id(n) << 1) | (n._in ? 0 : 1);
deba@430:     }
deba@430:     Node nodeFromId(int ix) const {
deba@430:       return Node(_digraph->nodeFromId(ix >> 1), (ix & 1) == 0);
deba@430:     }
deba@430:     int maxNodeId() const {
deba@430:       return 2 * _digraph->maxNodeId() + 1;
deba@430:     }
deba@430: 
deba@430:     int id(const Arc& e) const {
deba@430:       if (e._item.firstState()) {
deba@430:         return _digraph->id(e._item.first()) << 1;
deba@430:       } else {
deba@430:         return (_digraph->id(e._item.second()) << 1) | 1;
deba@430:       }
deba@430:     }
deba@430:     Arc arcFromId(int ix) const {
deba@430:       if ((ix & 1) == 0) {
deba@430:         return Arc(_digraph->arcFromId(ix >> 1));
deba@430:       } else {
deba@430:         return Arc(_digraph->nodeFromId(ix >> 1));
deba@430:       }
deba@430:     }
deba@430:     int maxArcId() const {
deba@432:       return std::max(_digraph->maxNodeId() << 1,
deba@430:                       (_digraph->maxArcId() << 1) | 1);
deba@430:     }
deba@430: 
deba@430:     static bool inNode(const Node& n) {
deba@430:       return n._in;
deba@430:     }
deba@430: 
deba@430:     static bool outNode(const Node& n) {
deba@430:       return !n._in;
deba@430:     }
deba@430: 
deba@430:     static bool origArc(const Arc& e) {
deba@430:       return e._item.firstState();
deba@430:     }
deba@430: 
deba@430:     static bool bindArc(const Arc& e) {
deba@430:       return e._item.secondState();
deba@430:     }
deba@430: 
deba@430:     static Node inNode(const DigraphNode& n) {
deba@430:       return Node(n, true);
deba@430:     }
deba@430: 
deba@430:     static Node outNode(const DigraphNode& n) {
deba@430:       return Node(n, false);
deba@430:     }
deba@430: 
deba@430:     static Arc arc(const DigraphNode& n) {
deba@430:       return Arc(n);
deba@430:     }
deba@430: 
deba@430:     static Arc arc(const DigraphArc& e) {
deba@430:       return Arc(e);
deba@430:     }
deba@430: 
deba@430:     typedef True NodeNumTag;
deba@430:     int nodeNum() const {
deba@430:       return  2 * countNodes(*_digraph);
deba@430:     }
deba@430: 
kpeter@469:     typedef True ArcNumTag;
deba@430:     int arcNum() const {
deba@430:       return countArcs(*_digraph) + countNodes(*_digraph);
deba@430:     }
deba@430: 
kpeter@469:     typedef True FindArcTag;
deba@432:     Arc findArc(const Node& u, const Node& v,
deba@432:                 const Arc& prev = INVALID) const {
kpeter@472:       if (inNode(u) && outNode(v)) {
kpeter@472:         if (static_cast<const DigraphNode&>(u) ==
kpeter@472:             static_cast<const DigraphNode&>(v) && prev == INVALID) {
kpeter@472:           return Arc(u);
deba@430:         }
kpeter@472:       }
kpeter@472:       else if (outNode(u) && inNode(v)) {
kpeter@472:         return Arc(::lemon::findArc(*_digraph, u, v, prev));
deba@430:       }
deba@430:       return INVALID;
deba@430:     }
deba@430: 
deba@430:   private:
deba@432: 
deba@430:     template <typename _Value>
deba@432:     class NodeMapBase
deba@430:       : public MapTraits<typename Parent::template NodeMap<_Value> > {
deba@430:       typedef typename Parent::template NodeMap<_Value> NodeImpl;
deba@430:     public:
deba@430:       typedef Node Key;
deba@430:       typedef _Value Value;
kpeter@472:       typedef typename MapTraits<NodeImpl>::ReferenceMapTag ReferenceMapTag;
kpeter@472:       typedef typename MapTraits<NodeImpl>::ReturnValue ReturnValue;
kpeter@472:       typedef typename MapTraits<NodeImpl>::ConstReturnValue ConstReturnValue;
kpeter@472:       typedef typename MapTraits<NodeImpl>::ReturnValue Reference;
kpeter@472:       typedef typename MapTraits<NodeImpl>::ConstReturnValue ConstReference;
deba@432: 
deba@432:       NodeMapBase(const Adaptor& adaptor)
deba@432:         : _in_map(*adaptor._digraph), _out_map(*adaptor._digraph) {}
deba@432:       NodeMapBase(const Adaptor& adaptor, const Value& value)
deba@432:         : _in_map(*adaptor._digraph, value),
deba@432:           _out_map(*adaptor._digraph, value) {}
deba@430: 
deba@430:       void set(const Node& key, const Value& val) {
deba@432:         if (Adaptor::inNode(key)) { _in_map.set(key, val); }
deba@432:         else {_out_map.set(key, val); }
deba@430:       }
deba@432: 
kpeter@472:       ReturnValue operator[](const Node& key) {
deba@432:         if (Adaptor::inNode(key)) { return _in_map[key]; }
deba@432:         else { return _out_map[key]; }
deba@430:       }
deba@430: 
kpeter@472:       ConstReturnValue operator[](const Node& key) const {
deba@432:         if (Adaptor::inNode(key)) { return _in_map[key]; }
deba@432:         else { return _out_map[key]; }
deba@430:       }
deba@430: 
deba@430:     private:
deba@430:       NodeImpl _in_map, _out_map;
deba@430:     };
deba@430: 
deba@430:     template <typename _Value>
deba@432:     class ArcMapBase
deba@430:       : public MapTraits<typename Parent::template ArcMap<_Value> > {
deba@430:       typedef typename Parent::template ArcMap<_Value> ArcImpl;
deba@430:       typedef typename Parent::template NodeMap<_Value> NodeImpl;
deba@430:     public:
deba@430:       typedef Arc Key;
deba@430:       typedef _Value Value;
kpeter@472:       typedef typename MapTraits<ArcImpl>::ReferenceMapTag ReferenceMapTag;
kpeter@472:       typedef typename MapTraits<ArcImpl>::ReturnValue ReturnValue;
kpeter@472:       typedef typename MapTraits<ArcImpl>::ConstReturnValue ConstReturnValue;
kpeter@472:       typedef typename MapTraits<ArcImpl>::ReturnValue Reference;
kpeter@472:       typedef typename MapTraits<ArcImpl>::ConstReturnValue ConstReference;
deba@430: 
deba@432:       ArcMapBase(const Adaptor& adaptor)
deba@432:         : _arc_map(*adaptor._digraph), _node_map(*adaptor._digraph) {}
deba@432:       ArcMapBase(const Adaptor& adaptor, const Value& value)
deba@432:         : _arc_map(*adaptor._digraph, value),
deba@432:           _node_map(*adaptor._digraph, value) {}
deba@430: 
deba@430:       void set(const Arc& key, const Value& val) {
deba@432:         if (Adaptor::origArc(key)) {
deba@432:           _arc_map.set(key._item.first(), val);
deba@430:         } else {
deba@432:           _node_map.set(key._item.second(), val);
deba@430:         }
deba@430:       }
deba@432: 
kpeter@472:       ReturnValue operator[](const Arc& key) {
deba@432:         if (Adaptor::origArc(key)) {
deba@430:           return _arc_map[key._item.first()];
deba@430:         } else {
deba@430:           return _node_map[key._item.second()];
deba@430:         }
deba@430:       }
deba@430: 
kpeter@472:       ConstReturnValue operator[](const Arc& key) const {
deba@432:         if (Adaptor::origArc(key)) {
deba@430:           return _arc_map[key._item.first()];
deba@430:         } else {
deba@430:           return _node_map[key._item.second()];
deba@430:         }
deba@430:       }
deba@430: 
deba@430:     private:
deba@430:       ArcImpl _arc_map;
deba@430:       NodeImpl _node_map;
deba@430:     };
deba@430: 
deba@430:   public:
deba@430: 
deba@430:     template <typename _Value>
deba@432:     class NodeMap
deba@432:       : public SubMapExtender<Adaptor, NodeMapBase<_Value> >
deba@430:     {
deba@430:     public:
deba@430:       typedef _Value Value;
deba@430:       typedef SubMapExtender<Adaptor, NodeMapBase<Value> > Parent;
deba@432: 
deba@432:       NodeMap(const Adaptor& adaptor)
deba@432:         : Parent(adaptor) {}
deba@432: 
deba@432:       NodeMap(const Adaptor& adaptor, const Value& value)
deba@432:         : Parent(adaptor, value) {}
deba@432: 
deba@430:     private:
deba@430:       NodeMap& operator=(const NodeMap& cmap) {
deba@432:         return operator=<NodeMap>(cmap);
deba@430:       }
deba@432: 
deba@430:       template <typename CMap>
deba@430:       NodeMap& operator=(const CMap& cmap) {
deba@430:         Parent::operator=(cmap);
deba@432:         return *this;
deba@430:       }
deba@430:     };
deba@430: 
deba@430:     template <typename _Value>
deba@432:     class ArcMap
deba@432:       : public SubMapExtender<Adaptor, ArcMapBase<_Value> >
deba@430:     {
deba@430:     public:
deba@430:       typedef _Value Value;
deba@430:       typedef SubMapExtender<Adaptor, ArcMapBase<Value> > Parent;
deba@432: 
deba@432:       ArcMap(const Adaptor& adaptor)
deba@432:         : Parent(adaptor) {}
deba@432: 
deba@432:       ArcMap(const Adaptor& adaptor, const Value& value)
deba@432:         : Parent(adaptor, value) {}
deba@432: 
deba@430:     private:
deba@430:       ArcMap& operator=(const ArcMap& cmap) {
deba@432:         return operator=<ArcMap>(cmap);
deba@430:       }
deba@432: 
deba@430:       template <typename CMap>
deba@430:       ArcMap& operator=(const CMap& cmap) {
deba@430:         Parent::operator=(cmap);
deba@432:         return *this;
deba@430:       }
deba@430:     };
deba@430: 
deba@430:   protected:
deba@430: 
deba@432:     SplitNodesBase() : _digraph(0) {}
deba@430: 
deba@430:     Digraph* _digraph;
deba@430: 
deba@430:     void setDigraph(Digraph& digraph) {
deba@430:       _digraph = &digraph;
deba@430:     }
deba@432: 
deba@430:   };
deba@430: 
deba@430:   /// \ingroup graph_adaptors
deba@430:   ///
kpeter@474:   /// \brief Adaptor class for splitting the nodes of a digraph.
deba@432:   ///
kpeter@474:   /// SplitNodes adaptor can be used for splitting each node into an
kpeter@474:   /// \e in-node and an \e out-node in a digraph. Formaly, the adaptor
kpeter@474:   /// replaces each node \f$ u \f$ in the digraph with two nodes,
kpeter@474:   /// namely node \f$ u_{in} \f$ and node \f$ u_{out} \f$.
kpeter@474:   /// If there is a \f$ (v, u) \f$ arc in the original digraph, then the
kpeter@474:   /// new target of the arc will be \f$ u_{in} \f$ and similarly the
kpeter@474:   /// source of each original \f$ (u, v) \f$ arc will be \f$ u_{out} \f$.
kpeter@474:   /// The adaptor adds an additional \e bind \e arc from \f$ u_{in} \f$
kpeter@474:   /// to \f$ u_{out} \f$ for each node \f$ u \f$ of the original digraph.
deba@430:   ///
kpeter@474:   /// The aim of this class is running an algorithm with respect to node
kpeter@474:   /// costs or capacities if the algorithm considers only arc costs or
kpeter@474:   /// capacities directly.
kpeter@474:   /// In this case you can use \c SplitNodes adaptor, and set the node
kpeter@474:   /// costs/capacities of the original digraph to the \e bind \e arcs
kpeter@474:   /// in the adaptor.
deba@430:   ///
kpeter@476:   /// \tparam GR The type of the adapted digraph.
kpeter@474:   /// It must conform to the \ref concepts::Digraph "Digraph" concept.
kpeter@474:   /// It is implicitly \c const.
kpeter@474:   ///
kpeter@474:   /// \note The \c Node type of this adaptor is converible to the \c Node
kpeter@474:   /// type of the adapted digraph.
kpeter@476:   template <typename GR>
kpeter@476: #ifdef DOXYGEN
kpeter@476:   class SplitNodes {
kpeter@476: #else
deba@432:   class SplitNodes
kpeter@476:     : public DigraphAdaptorExtender<SplitNodesBase<const GR> > {
kpeter@476: #endif
deba@430:   public:
kpeter@476:     typedef GR Digraph;
kpeter@476:     typedef DigraphAdaptorExtender<SplitNodesBase<const GR> > Parent;
deba@430: 
deba@431:     typedef typename Digraph::Node DigraphNode;
deba@431:     typedef typename Digraph::Arc DigraphArc;
deba@431: 
deba@430:     typedef typename Parent::Node Node;
deba@430:     typedef typename Parent::Arc Arc;
deba@430: 
kpeter@474:     /// \brief Constructor
deba@430:     ///
deba@430:     /// Constructor of the adaptor.
kpeter@471:     SplitNodes(const Digraph& g) {
deba@430:       Parent::setDigraph(g);
deba@430:     }
deba@430: 
kpeter@474:     /// \brief Returns \c true if the given node is an in-node.
deba@431:     ///
kpeter@474:     /// Returns \c true if the given node is an in-node.
deba@431:     static bool inNode(const Node& n) {
deba@431:       return Parent::inNode(n);
deba@431:     }
deba@431: 
kpeter@474:     /// \brief Returns \c true if the given node is an out-node.
deba@431:     ///
kpeter@474:     /// Returns \c true if the given node is an out-node.
deba@431:     static bool outNode(const Node& n) {
deba@431:       return Parent::outNode(n);
deba@431:     }
deba@431: 
kpeter@474:     /// \brief Returns \c true if the given arc is an original arc.
deba@431:     ///
kpeter@474:     /// Returns \c true if the given arc is one of the arcs in the
kpeter@474:     /// original digraph.
deba@431:     static bool origArc(const Arc& a) {
deba@431:       return Parent::origArc(a);
deba@431:     }
deba@431: 
kpeter@474:     /// \brief Returns \c true if the given arc is a bind arc.
deba@431:     ///
kpeter@474:     /// Returns \c true if the given arc is a bind arc, i.e. it connects
kpeter@474:     /// an in-node and an out-node.
deba@431:     static bool bindArc(const Arc& a) {
deba@431:       return Parent::bindArc(a);
deba@431:     }
deba@431: 
kpeter@474:     /// \brief Returns the in-node created from the given original node.
deba@431:     ///
kpeter@474:     /// Returns the in-node created from the given original node.
deba@431:     static Node inNode(const DigraphNode& n) {
deba@431:       return Parent::inNode(n);
deba@431:     }
deba@431: 
kpeter@474:     /// \brief Returns the out-node created from the given original node.
deba@431:     ///
kpeter@474:     /// Returns the out-node created from the given original node.
deba@431:     static Node outNode(const DigraphNode& n) {
deba@431:       return Parent::outNode(n);
deba@431:     }
deba@431: 
kpeter@474:     /// \brief Returns the bind arc that corresponds to the given
kpeter@474:     /// original node.
deba@432:     ///
kpeter@474:     /// Returns the bind arc in the adaptor that corresponds to the given
kpeter@474:     /// original node, i.e. the arc connecting the in-node and out-node
kpeter@474:     /// of \c n.
deba@431:     static Arc arc(const DigraphNode& n) {
deba@431:       return Parent::arc(n);
deba@431:     }
deba@431: 
kpeter@474:     /// \brief Returns the arc that corresponds to the given original arc.
deba@432:     ///
kpeter@474:     /// Returns the arc in the adaptor that corresponds to the given
kpeter@474:     /// original arc.
deba@431:     static Arc arc(const DigraphArc& a) {
deba@431:       return Parent::arc(a);
deba@431:     }
deba@431: 
kpeter@474:     /// \brief Node map combined from two original node maps
deba@430:     ///
kpeter@474:     /// This map adaptor class adapts two node maps of the original digraph
kpeter@474:     /// to get a node map of the split digraph.
kpeter@474:     /// Its value type is inherited from the first node map type
kpeter@474:     /// (\c InNodeMap).
deba@430:     template <typename InNodeMap, typename OutNodeMap>
deba@430:     class CombinedNodeMap {
deba@430:     public:
deba@430: 
kpeter@474:       /// The key type of the map
deba@430:       typedef Node Key;
kpeter@474:       /// The value type of the map
deba@430:       typedef typename InNodeMap::Value Value;
deba@430: 
kpeter@472:       typedef typename MapTraits<InNodeMap>::ReferenceMapTag ReferenceMapTag;
kpeter@472:       typedef typename MapTraits<InNodeMap>::ReturnValue ReturnValue;
kpeter@472:       typedef typename MapTraits<InNodeMap>::ConstReturnValue ConstReturnValue;
kpeter@472:       typedef typename MapTraits<InNodeMap>::ReturnValue Reference;
kpeter@472:       typedef typename MapTraits<InNodeMap>::ConstReturnValue ConstReference;
kpeter@472: 
kpeter@474:       /// Constructor
deba@432:       CombinedNodeMap(InNodeMap& in_map, OutNodeMap& out_map)
deba@432:         : _in_map(in_map), _out_map(out_map) {}
deba@430: 
kpeter@474:       /// Returns the value associated with the given key.
kpeter@474:       Value operator[](const Key& key) const {
kpeter@474:         if (Parent::inNode(key)) {
kpeter@474:           return _in_map[key];
kpeter@474:         } else {
kpeter@474:           return _out_map[key];
kpeter@474:         }
kpeter@474:       }
kpeter@474: 
kpeter@474:       /// Returns a reference to the value associated with the given key.
deba@430:       Value& operator[](const Key& key) {
deba@432:         if (Parent::inNode(key)) {
deba@432:           return _in_map[key];
deba@432:         } else {
deba@432:           return _out_map[key];
deba@432:         }
deba@430:       }
deba@430: 
kpeter@474:       /// Sets the value associated with the given key.
deba@430:       void set(const Key& key, const Value& value) {
deba@432:         if (Parent::inNode(key)) {
deba@432:           _in_map.set(key, value);
deba@432:         } else {
deba@432:           _out_map.set(key, value);
deba@432:         }
deba@430:       }
deba@432: 
deba@430:     private:
deba@432: 
deba@430:       InNodeMap& _in_map;
deba@430:       OutNodeMap& _out_map;
deba@432: 
deba@430:     };
deba@430: 
deba@430: 
kpeter@474:     /// \brief Returns a combined node map
deba@432:     ///
kpeter@474:     /// This function just returns a combined node map.
deba@430:     template <typename InNodeMap, typename OutNodeMap>
deba@432:     static CombinedNodeMap<InNodeMap, OutNodeMap>
deba@430:     combinedNodeMap(InNodeMap& in_map, OutNodeMap& out_map) {
deba@430:       return CombinedNodeMap<InNodeMap, OutNodeMap>(in_map, out_map);
deba@430:     }
deba@430: 
deba@430:     template <typename InNodeMap, typename OutNodeMap>
deba@432:     static CombinedNodeMap<const InNodeMap, OutNodeMap>
deba@430:     combinedNodeMap(const InNodeMap& in_map, OutNodeMap& out_map) {
deba@430:       return CombinedNodeMap<const InNodeMap, OutNodeMap>(in_map, out_map);
deba@430:     }
deba@430: 
deba@430:     template <typename InNodeMap, typename OutNodeMap>
deba@432:     static CombinedNodeMap<InNodeMap, const OutNodeMap>
deba@430:     combinedNodeMap(InNodeMap& in_map, const OutNodeMap& out_map) {
deba@430:       return CombinedNodeMap<InNodeMap, const OutNodeMap>(in_map, out_map);
deba@430:     }
deba@430: 
deba@430:     template <typename InNodeMap, typename OutNodeMap>
deba@432:     static CombinedNodeMap<const InNodeMap, const OutNodeMap>
deba@430:     combinedNodeMap(const InNodeMap& in_map, const OutNodeMap& out_map) {
deba@432:       return CombinedNodeMap<const InNodeMap,
deba@430:         const OutNodeMap>(in_map, out_map);
deba@430:     }
deba@430: 
kpeter@474:     /// \brief Arc map combined from an arc map and a node map of the
kpeter@474:     /// original digraph.
deba@430:     ///
kpeter@474:     /// This map adaptor class adapts an arc map and a node map of the
kpeter@474:     /// original digraph to get an arc map of the split digraph.
kpeter@474:     /// Its value type is inherited from the original arc map type
kpeter@476:     /// (\c ArcMap).
kpeter@476:     template <typename ArcMap, typename NodeMap>
deba@430:     class CombinedArcMap {
deba@430:     public:
deba@432: 
kpeter@474:       /// The key type of the map
deba@430:       typedef Arc Key;
kpeter@474:       /// The value type of the map
kpeter@476:       typedef typename ArcMap::Value Value;
kpeter@476: 
kpeter@476:       typedef typename MapTraits<ArcMap>::ReferenceMapTag ReferenceMapTag;
kpeter@476:       typedef typename MapTraits<ArcMap>::ReturnValue ReturnValue;
kpeter@476:       typedef typename MapTraits<ArcMap>::ConstReturnValue ConstReturnValue;
kpeter@476:       typedef typename MapTraits<ArcMap>::ReturnValue Reference;
kpeter@476:       typedef typename MapTraits<ArcMap>::ConstReturnValue ConstReference;
kpeter@472: 
kpeter@474:       /// Constructor
kpeter@476:       CombinedArcMap(ArcMap& arc_map, NodeMap& node_map)
deba@432:         : _arc_map(arc_map), _node_map(node_map) {}
deba@430: 
kpeter@474:       /// Returns the value associated with the given key.
kpeter@474:       Value operator[](const Key& arc) const {
kpeter@474:         if (Parent::origArc(arc)) {
kpeter@474:           return _arc_map[arc];
kpeter@474:         } else {
kpeter@474:           return _node_map[arc];
kpeter@474:         }
kpeter@474:       }
kpeter@474: 
kpeter@474:       /// Returns a reference to the value associated with the given key.
kpeter@474:       Value& operator[](const Key& arc) {
kpeter@474:         if (Parent::origArc(arc)) {
kpeter@474:           return _arc_map[arc];
kpeter@474:         } else {
kpeter@474:           return _node_map[arc];
kpeter@474:         }
kpeter@474:       }
kpeter@474: 
kpeter@474:       /// Sets the value associated with the given key.
deba@430:       void set(const Arc& arc, const Value& val) {
deba@432:         if (Parent::origArc(arc)) {
deba@432:           _arc_map.set(arc, val);
deba@432:         } else {
deba@432:           _node_map.set(arc, val);
deba@432:         }
deba@430:       }
deba@430: 
deba@430:     private:
kpeter@476:       ArcMap& _arc_map;
kpeter@476:       NodeMap& _node_map;
deba@430:     };
deba@432: 
kpeter@474:     /// \brief Returns a combined arc map
deba@432:     ///
kpeter@474:     /// This function just returns a combined arc map.
kpeter@476:     template <typename ArcMap, typename NodeMap>
kpeter@476:     static CombinedArcMap<ArcMap, NodeMap>
kpeter@476:     combinedArcMap(ArcMap& arc_map, NodeMap& node_map) {
kpeter@476:       return CombinedArcMap<ArcMap, NodeMap>(arc_map, node_map);
deba@430:     }
deba@430: 
kpeter@476:     template <typename ArcMap, typename NodeMap>
kpeter@476:     static CombinedArcMap<const ArcMap, NodeMap>
kpeter@476:     combinedArcMap(const ArcMap& arc_map, NodeMap& node_map) {
kpeter@476:       return CombinedArcMap<const ArcMap, NodeMap>(arc_map, node_map);
deba@430:     }
deba@430: 
kpeter@476:     template <typename ArcMap, typename NodeMap>
kpeter@476:     static CombinedArcMap<ArcMap, const NodeMap>
kpeter@476:     combinedArcMap(ArcMap& arc_map, const NodeMap& node_map) {
kpeter@476:       return CombinedArcMap<ArcMap, const NodeMap>(arc_map, node_map);
deba@430:     }
deba@430: 
kpeter@476:     template <typename ArcMap, typename NodeMap>
kpeter@476:     static CombinedArcMap<const ArcMap, const NodeMap>
kpeter@476:     combinedArcMap(const ArcMap& arc_map, const NodeMap& node_map) {
kpeter@476:       return CombinedArcMap<const ArcMap, const NodeMap>(arc_map, node_map);
deba@430:     }
deba@430: 
deba@430:   };
deba@430: 
kpeter@474:   /// \brief Returns a (read-only) SplitNodes adaptor
deba@430:   ///
kpeter@474:   /// This function just returns a (read-only) \ref SplitNodes adaptor.
kpeter@474:   /// \ingroup graph_adaptors
kpeter@474:   /// \relates SplitNodes
kpeter@476:   template<typename GR>
kpeter@476:   SplitNodes<GR>
kpeter@476:   splitNodes(const GR& digraph) {
kpeter@476:     return SplitNodes<GR>(digraph);
deba@430:   }
deba@430: 
deba@430: } //namespace lemon
deba@430: 
deba@432: #endif //LEMON_ADAPTORS_H