RhodeCode

#else

  template<typename GR,

           typename EF = typename GR::template EdgeMap<bool> >

  class FilterEdges :

    public GraphAdaptorExtender<

      SubGraphBase<GR, ConstMap<typename GR::Node, Const<bool, true> >, 

                   EF, false> > {

#endif

    typedef GraphAdaptorExtender<

      SubGraphBase<GR, ConstMap<typename GR::Node, Const<bool, true > >, 

                   EF, false> > Parent;

  public:

    /// The type of the adapted graph.

    typedef GR Graph;

    /// The type of the edge filter map.

    typedef EF EdgeFilterMap;

    typedef typename Parent::Edge Edge;

  protected:

    ConstMap<typename GR::Node, Const<bool, true> > const_true_map;

    FilterEdges() : const_true_map(true) {

      Parent::setNodeFilterMap(const_true_map);

    }

  public:

    /// \brief Constructor

    ///

    /// Creates a subgraph for the given graph with the given edge

    /// filter map.

    FilterEdges(GR& graph, EF& edge_filter) 

      : Parent(), const_true_map() {

      Parent::initialize(graph, const_true_map, edge_filter);

    }

    /// \brief Sets the status of the given edge

    ///

    /// This function sets the status of the given edge.

    /// It is done by simply setting the assigned value of \c e

    /// to \c v in the edge filter map.

    void status(const Edge& e, bool v) const { Parent::status(e, v); }

    /// \brief Returns the status of the given edge

    ///

    /// This function returns the status of the given edge.

    /// It is \c true if the given edge is enabled (i.e. not hidden).

    bool status(const Edge& e) const { return Parent::status(e); }

    /// \brief Disables the given edge

    ///

    /// This function disables the given edge in the subgraph,

    /// so the iteration jumps over it.

    /// It is the same as \ref status() "status(e, false)".

    void disable(const Edge& e) const { Parent::status(e, false); }

    /// \brief Enables the given edge

    ///

    /// This function enables the given edge in the subgraph.

    /// It is the same as \ref status() "status(e, true)".

    void enable(const Edge& e) const { Parent::status(e, true); }

  };

  /// \brief Returns a read-only FilterEdges adaptor

  ///

  /// This function just returns a read-only \ref FilterEdges adaptor.

  /// \ingroup graph_adaptors

  /// \relates FilterEdges

  template<typename GR, typename EF>

  FilterEdges<const GR, EF>

  filterEdges(const GR& graph, EF& edge_filter) {

    return FilterEdges<const GR, EF>(graph, edge_filter);

  }

  template<typename GR, typename EF>

  FilterEdges<const GR, const EF>

  filterEdges(const GR& graph, const EF& edge_filter) {

    return FilterEdges<const GR, const EF>(graph, edge_filter);

  }

  template <typename DGR>

  class UndirectorBase {

  public:

    typedef DGR Digraph;

    typedef UndirectorBase Adaptor;

    typedef True UndirectedTag;

    typedef typename Digraph::Arc Edge;

    typedef typename Digraph::Node Node;

      friend class UndirectorBase;

    protected:

      bool _forward;

    public:

      Arc() {}

      bool operator==(const Arc &other) const {

      }

      bool operator!=(const Arc &other) const {

      }

      bool operator<(const Arc &other) const {

        return _forward < other._forward ||

      }

    };

    void first(Node& n) const {

      _digraph->first(n);

    }

    void next(Node& n) const {

      _digraph->next(n);

    }

    void first(Arc& a) const {

      a._forward = true;

    }

    void next(Arc& a) const {

      if (a._forward) {

        a._forward = false;

      } else {

        a._forward = true;

      }

    }

    void first(Edge& e) const {

      _digraph->first(e);

    }

    void next(Edge& e) const {

      _digraph->next(e);

    }

    void firstOut(Arc& a, const Node& n) const {

        a._forward = false;

      } else {

        a._forward = true;

      }

    }

    void nextOut(Arc &a) const {

      if (!a._forward) {

          a._forward = true;

        }

      }

      else {

      }

    }

    void firstIn(Arc &a, const Node &n) const {

        a._forward = false;

      } else {

        a._forward = true;

      }

    }

    void nextIn(Arc &a) const {

      if (!a._forward) {

          a._forward = true;

        }

      }

      else {

      }

    }

    void firstInc(Edge &e, bool &d, const Node &n) const {

      d = true;

      _digraph->firstOut(e, n);

      if (e != INVALID) return;

      d = false;

      _digraph->firstIn(e, n);

    }

    void nextInc(Edge &e, bool &d) const {

      if (d) {

        Node s = _digraph->source(e);

        _digraph->nextOut(e);

        if (e != INVALID) return;

        d = false;

        _digraph->firstIn(e, s);

      } else {

        _digraph->nextIn(e);

      }

    }

    Node u(const Edge& e) const {

      return _digraph->source(e);

    }

    Node v(const Edge& e) const {

      return _digraph->target(e);

    }

    Node source(const Arc &a) const {

    }

    Node target(const Arc &a) const {

    }

    static Arc direct(const Edge &e, bool d) {

      return Arc(e, d);

    }

    static bool direction(const Arc &a) { return a._forward; }

    Node nodeFromId(int ix) const { return _digraph->nodeFromId(ix); }

    Arc arcFromId(int ix) const {

      return direct(_digraph->arcFromId(ix >> 1), bool(ix & 1));

    }

    Edge edgeFromId(int ix) const { return _digraph->arcFromId(ix); }

    int id(const Node &n) const { return _digraph->id(n); }

    int id(const Arc &a) const {

      return  (_digraph->id(a) << 1) | (a._forward ? 1 : 0);

    }

    int id(const Edge &e) const { return _digraph->id(e); }

    int maxNodeId() const { return _digraph->maxNodeId(); }

    int maxArcId() const { return (_digraph->maxArcId() << 1) | 1; }

    int maxEdgeId() const { return _digraph->maxArcId(); }

    Node addNode() { return _digraph->addNode(); }

    Edge addEdge(const Node& u, const Node& v) {

      return _digraph->addArc(u, v);

    }

    void erase(const Node& i) { _digraph->erase(i); }

    void erase(const Edge& i) { _digraph->erase(i); }

    void clear() { _digraph->clear(); }

    typedef NodeNumTagIndicator<Digraph> NodeNumTag;

    int nodeNum() const { return _digraph->nodeNum(); }

    typedef ArcNumTagIndicator<Digraph> ArcNumTag;

    int arcNum() const { return 2 * _digraph->arcNum(); }

    typedef ArcNumTag EdgeNumTag;

    int edgeNum() const { return _digraph->arcNum(); }

    typedef FindArcTagIndicator<Digraph> FindArcTag;

    Arc findArc(Node s, Node t, Arc p = INVALID) const {

      if (p == INVALID) {

        Edge arc = _digraph->findArc(s, t);

        if (arc != INVALID) return direct(arc, true);

        arc = _digraph->findArc(t, s);

        if (arc != INVALID) return direct(arc, false);

      } else if (direction(p)) {

        Edge arc = _digraph->findArc(s, t, p);

        if (arc != INVALID) return direct(arc, true);

        arc = _digraph->findArc(t, s);

        if (arc != INVALID) return direct(arc, false);

      } else {

        Edge arc = _digraph->findArc(t, s, p);

        if (arc != INVALID) return direct(arc, false);

      }

      return INVALID;

    }

    typedef FindArcTag FindEdgeTag;

    Edge findEdge(Node s, Node t, Edge p = INVALID) const {

      if (s != t) {

        if (p == INVALID) {

          Edge arc = _digraph->findArc(s, t);

          if (arc != INVALID) return arc;

          arc = _digraph->findArc(t, s);

          if (arc != INVALID) return arc;

        } else if (_digraph->source(p) == s) {

          Edge arc = _digraph->findArc(s, t, p);

          if (arc != INVALID) return arc;

          arc = _digraph->findArc(t, s);

          if (arc != INVALID) return arc;

        } else {

          Edge arc = _digraph->findArc(t, s, p);

          if (arc != INVALID) return arc;

        }

      } else {

        return _digraph->findArc(s, t, p);

      }

      return INVALID;

    }

  private:

    template <typename V>

    class ArcMapBase {

    private:

      typedef typename DGR::template ArcMap<V> MapImpl;

    public:

      typedef typename MapTraits<MapImpl>::ReferenceMapTag ReferenceMapTag;

      typedef V Value;

      typedef Arc Key;

      typedef typename MapTraits<MapImpl>::ConstReturnValue ConstReturnValue;

      typedef typename MapTraits<MapImpl>::ReturnValue ReturnValue;