RhodeCode

    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.

    typedef typename Digraph::template NodeMap<typename Digraph::Arc> PredMap;

    ///\param g is the digraph, to which we would like to define the

    static PredMap *createPredMap(const Digraph &g)

    {

    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.

    typedef NullMap<typename Digraph::Node,bool> ProcessedMap;

    ///\param g is the digraph, to which

#ifdef DOXYGEN

    static ProcessedMap *createProcessedMap(const Digraph &g)

    ///It must meet the \ref concepts::ReadWriteMap "ReadWriteMap" concept.

    typedef typename Digraph::template NodeMap<bool> ReachedMap;

    ///\param g is the digraph, to which

    static ReachedMap *createReachedMap(const Digraph &g)

    {

    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.

    typedef typename Digraph::template NodeMap<int> DistMap;

    ///\param g is the digraph, to which we would like to define the

    static DistMap *createDistMap(const Digraph &g)

    {

    };

    ///\brief \ref named-templ-param "Named parameter" for setting

    ///

    ///\ref named-templ-param "Named parameter" for setting

    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.

    template <class T>

    };

    ///\brief \ref named-templ-param "Named parameter" for setting

    ///

    ///\ref named-templ-param "Named parameter" for setting

    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.

    template <class T>

    };

    ///\brief \ref named-templ-param "Named parameter" for setting

    ///

    ///\ref named-templ-param "Named parameter" for setting

    ///It must meet the \ref concepts::ReadWriteMap "ReadWriteMap" concept.

    template <class T>

    };

    ///\brief \ref named-templ-param "Named parameter" for setting

    ///

    ///\ref named-templ-param "Named parameter" for setting

    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.

    template <class T>

    };

    ///\brief \ref named-templ-param "Named parameter" for setting

    ///

    ///\ref named-templ-param "Named parameter" for setting

    ///If you don't set it explicitly, it will be automatically allocated.

    struct SetStandardProcessedMap :

  /// This class defines the interface of the BfsVisit events, and

  /// it could be the base of a real visitor class.

  struct BfsVisitor {

    typedef typename Digraph::Arc Arc;

    typedef typename Digraph::Node Node;

  };

#else

  struct BfsVisitor {

    typedef typename Digraph::Arc Arc;

    typedef typename Digraph::Node Node;

  ///

  /// Default traits class of BfsVisit class.

  struct BfsVisitDefaultTraits {

    /// \brief The type of the digraph the algorithm runs on.

    /// \brief The type of the map that indicates which nodes are reached.

  /// \ingroup search

  ///

  ///

  /// with visitor interface.

  ///

  /// class. It works with callback mechanism, the BfsVisit object calls

  /// the member functions of the \c Visitor class on every BFS event.

  /// instead.

  ///

  /// does not observe the BFS events. If you want to observe the BFS

  /// events, you should implement your own visitor class.

  /// algorithm. The default traits class is

  /// See \ref BfsVisitDefaultTraits for the documentation of

  /// a BFS visit traits class.

#ifdef DOXYGEN

#else

#endif

  class BfsVisit {

    ///The traits class.

    ///The type of the digraph the algorithm runs on.

    ///The visitor type used by the algorithm.

    ///The type of the map that indicates which nodes are reached.

    // \brief Template assign operator.

    //

    // concecpt and could be indiced by the current item set of

    // the NodeMap. In this case the value for each item

    // \brief Template assign operator.

    //

    // concecpt and could be indiced by the current item set of

    // the NodeMap. In this case the value for each item

  ///

  /// Default traits class of Circulation class.

  struct CirculationDefaultTraits {

    /// \brief The type of the digraph the algorithm runs on.

    /// \brief The type of the map that stores the circulation lower

    /// The type of the map that stores the circulation lower bound.

    /// It must meet the \ref concepts::ReadMap "ReadMap" concept.

    /// \brief The type of the map that stores the circulation upper

    /// The type of the map that stores the circulation upper bound.

    /// It must meet the \ref concepts::ReadMap "ReadMap" concept.

    /// \brief The type of the map that stores the lower bound for

    /// of the nodes. It must meet the \ref concepts::ReadMap "ReadMap"

    /// concept.

    /// \brief The type of the flow values.

     in this way.

     for the supply of the nodes. The default map type is

  */

#ifdef DOXYGEN

#else

#endif

  class Circulation {

    ///The \ref CirculationDefaultTraits "traits class" of the algorithm.

    ///The type of the digraph the algorithm runs on.

    typedef typename Traits::Digraph Digraph;

    ///

    /// This class provides the minimal set of features needed for a

    /// conform to this base directed graph. It just provides types

    /// for nodes and arcs and functions to get the source and the

    /// This class provides the minimal set of features needed for an

    /// undirected graph structure. All undirected graph concepts have

    /// nodes, arcs and edges and functions to get the

    /// source and the target of the arcs and edges,

    /// This class provides beside the core digraph features

    /// core id functions for the digraph structure.

    /// The id's are unique and immutable.

    template <typename _Base = BaseDigraphComponent>

    /// This class provides beside the core undirected graph features

    /// core id functions for the undirected graph structure.  The

    /// concept.  The id's are unique and immutable.

    template <typename _Base = BaseGraphComponent>

    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.

    typedef typename Digraph::template NodeMap<typename Digraph::Arc> PredMap;

    ///\param g is the digraph, to which we would like to define the

    static PredMap *createPredMap(const Digraph &g)

    {

    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.

    typedef NullMap<typename Digraph::Node,bool> ProcessedMap;

    ///\param g is the digraph, to which

#ifdef DOXYGEN

    static ProcessedMap *createProcessedMap(const Digraph &g)

    ///It must meet the \ref concepts::ReadWriteMap "ReadWriteMap" concept.

    typedef typename Digraph::template NodeMap<bool> ReachedMap;

    ///\param g is the digraph, to which

    static ReachedMap *createReachedMap(const Digraph &g)

    {

    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.

    typedef typename Digraph::template NodeMap<int> DistMap;

    ///\param g is the digraph, to which we would like to define the

    static DistMap *createDistMap(const Digraph &g)

    {

    };

    ///\brief \ref named-templ-param "Named parameter" for setting

    ///

    ///\ref named-templ-param "Named parameter" for setting

    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.

    template <class T>

    };

    ///\brief \ref named-templ-param "Named parameter" for setting

    ///

    ///\ref named-templ-param "Named parameter" for setting

    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.

    template <class T>

    };

    ///\brief \ref named-templ-param "Named parameter" for setting

    ///

    ///\ref named-templ-param "Named parameter" for setting

    ///It must meet the \ref concepts::ReadWriteMap "ReadWriteMap" concept.

    template <class T>

    };

    ///\brief \ref named-templ-param "Named parameter" for setting

    ///

    ///\ref named-templ-param "Named parameter" for setting

    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.

    template <class T>

    };

    ///\brief \ref named-templ-param "Named parameter" for setting

    ///

    ///\ref named-templ-param "Named parameter" for setting

    ///If you don't set it explicitly, it will be automatically allocated.

    struct SetStandardProcessedMap :

  /// This class defines the interface of the DfsVisit events, and

  /// it could be the base of a real visitor class.

  struct DfsVisitor {

    typedef typename Digraph::Arc Arc;

    typedef typename Digraph::Node Node;

  };

#else

  struct DfsVisitor {

    typedef typename Digraph::Arc Arc;

    typedef typename Digraph::Node Node;

  /// Default traits class of DfsVisit class.

  /// \tparam _Digraph The type of the digraph the algorithm runs on.

  struct DfsVisitDefaultTraits {

    /// \brief The type of the digraph the algorithm runs on.

    /// \brief The type of the map that indicates which nodes are reached.

  /// \ingroup search

  ///

  ///

  /// with visitor interface.

  ///

  /// class. It works with callback mechanism, the DfsVisit object calls

  /// the member functions of the \c Visitor class on every DFS event.

  /// instead.

  ///

  /// does not observe the DFS events. If you want to observe the DFS

  /// events, you should implement your own visitor class.

  /// algorithm. The default traits class is

  /// See \ref DfsVisitDefaultTraits for the documentation of

  /// a DFS visit traits class.

#ifdef DOXYGEN

#else

#endif

  class DfsVisit {

    ///The traits class.

    ///The type of the digraph the algorithm runs on.

    ///The visitor type used by the algorithm.

    ///The type of the map that indicates which nodes are reached.

    typedef typename LM::Value Value;

    /// This class defines the operations that are used in the algorithm.

    /// Usually it is \c Digraph::NodeMap<int>.

    typedef typename Digraph::template NodeMap<int> HeapCrossRef;

    ///This function instantiates a \ref HeapCrossRef.

    }

    ///The heap type used by the Dijkstra algorithm.

    ///\sa Dijkstra

    typedef BinHeap<typename LM::Value, HeapCrossRef, std::less<Value> > Heap;

    ///This function instantiates a \ref Heap.

    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.

    typedef typename Digraph::template NodeMap<typename Digraph::Arc> PredMap;

    ///\param g is the digraph, to which we would like to define the

    static PredMap *createPredMap(const Digraph &g)

    {

    ///By default it is a NullMap.

    typedef NullMap<typename Digraph::Node,bool> ProcessedMap;

    ///\param g is the digraph, to which

#ifdef DOXYGEN

    static ProcessedMap *createProcessedMap(const Digraph &g)

    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.

    typedef typename Digraph::template NodeMap<typename LM::Value> DistMap;

    ///\param g is the digraph, to which we would like to define

    static DistMap *createDistMap(const Digraph &g)

    {

    ///The heap type used by the algorithm.

    typedef typename TR::Heap Heap;

    typedef typename TR::OperationTraits OperationTraits;

    const Digraph *G;

    //Pointer to the length map.

    //Pointer to the map of predecessors arcs.

    PredMap *_pred;

    };

    ///\brief \ref named-templ-param "Named parameter" for setting

    ///

    ///\ref named-templ-param "Named parameter" for setting

    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.

    template <class T>

    };

    ///\brief \ref named-templ-param "Named parameter" for setting

    ///

    ///\ref named-templ-param "Named parameter" for setting

    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.

    template <class T>

    };

    ///\brief \ref named-templ-param "Named parameter" for setting

    ///

    ///\ref named-templ-param "Named parameter" for setting

    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.

    template <class T>

    };

    ///\brief \ref named-templ-param "Named parameter" for setting

    ///

    ///\ref named-templ-param "Named parameter" for setting

    ///If you don't set it explicitly, it will be automatically allocated.

    struct SetStandardProcessedMap

    ///

    ///\ref named-templ-param "Named parameter" for setting

    template <class T>

    struct SetOperationTraits

    ///Constructor.

      _pred(NULL), local_pred(false),

      _dist(NULL), local_dist(false),

    Dijkstra &lengthMap(const LengthMap &m)

    {

      return *this;

    }

        switch(_heap->state(w)) {

        case Heap::PRE_HEAP:

          _pred->set(w,e);

          break;

        case Heap::IN_HEAP:

          {

            if ( OperationTraits::less(newvalue, (*_heap)[w]) ) {

              _heap->decrease(w, newvalue);

  ///

  /// Default traits class of Preflow class.

  struct PreflowDefaultTraits {

    /// \brief The type of the digraph the algorithm runs on.

    /// \brief The type of the map that stores the arc capacities.

    /// The type of the map that stores the arc capacities.

    /// It must meet the \ref concepts::ReadMap "ReadMap" concept.

    /// \brief The type of the flow values.

  /// second phase constructs a feasible maximum flow on each arc.

  ///

#ifdef DOXYGEN

#else

#endif

  class Preflow {

    ///The \ref PreflowDefaultTraits "traits class" of the algorithm.

    ///The type of the digraph the algorithm runs on.

    typedef typename Traits::Digraph Digraph;