RhodeCode

  public:

    typedef _Graph Graph;

    typedef typename Graph::Edge Parent;

    typedef typename Graph::Edge Edge;

    typedef typename Graph::Node Node;

    /// \brief Constructor.

    ///

    /// Construct a new ConEdgeIt iterating on the edges that

    /// connects nodes \c u and \c v.

    }

    /// \brief Constructor.

    ///

    /// Construct a new ConEdgeIt that continues iterating from edge \c e.

    ConEdgeIt(const Graph& g, Edge e) : Parent(e), _graph(g) {}

    /// \brief Increment operator.

    ///

    /// It increments the iterator and gives back the next edge.

    ConEdgeIt& operator++() {

      return *this;

    }

  private:

    const Graph& _graph;

  };

  ///Dynamic arc look-up between given endpoints.

  ///Using this class, you can find an arc in a digraph from a given

  ///source to a given target in amortized time <em>O</em>(log<em>d</em>),

  ///where <em>d</em> is the out-degree of the source node.

  ///

  ///It is possible to find \e all parallel arcs between two nodes with

  ///the \c operator() member.

  ///