RhodeCode

 * This file is a part of LEMON, a generic C++ optimization library.

 *

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

  // about memory leaks.

  ap.throwOnProblems();

  // Perform the parsing process

  // (in case of any error it terminates the program)

 * This file is a part of LEMON, a generic C++ optimization library.

 *

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

 * This file is a part of LEMON, a generic C++ optimization library.

 *

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

It is a C++ template library providing efficient implementations of common

data structures and algorithms with focus on combinatorial optimization

<b>

</b>

<a href="http://www.cs.elte.hu/egres/">Egerv&aacute;ry Research Group on

Combinatorial Optimization</a> \ref egres

 * This file is a part of LEMON, a generic C++ optimization library.

 *

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

   - if \f$\sum_{uv\in A} f(uv) - \sum_{vu\in A} f(vu) \neq sup(u)\f$,

     then \f$\pi(u)=0\f$.

Here \f$cost^\pi(uv)\f$ denotes the \e reduced \e cost of the arc

\f$uv\in A\f$ with respect to the potential function \f$\pi\f$, i.e.

\f[ lower(uv) \leq f(uv) \leq upper(uv) \quad \forall uv\in A \f]

total supply (i.e. \f$\sum_{u\in V} sup(u)\f$ must be zero or

positive) and all the demands have to be satisfied, but there

 * This file is a part of LEMON, a generic C++ optimization library.

 *

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

      Parent::initialize(digraph);

      _node_filter = &node_filter;

    }

    template <typename V>

      typedef SubMapExtender<SubDigraphBase<DGR, NF, AF, ch>,

    public:

    template <typename V>

      : public SubMapExtender<SubDigraphBase<DGR, NF, AF, ch>,

      typedef SubMapExtender<SubDigraphBase<DGR, NF, AF, ch>,

        LEMON_SCOPE_FIX(DigraphAdaptorBase<DGR>, ArcMap<V>)> Parent;

      Parent::initialize(digraph);

      _node_filter = &node_filter;

    }

    template <typename V>

      : public SubMapExtender<SubDigraphBase<DGR, NF, AF, false>,

          LEMON_SCOPE_FIX(DigraphAdaptorBase<DGR>, NodeMap<V>)> {

        LEMON_SCOPE_FIX(DigraphAdaptorBase<DGR>, NodeMap<V>)> Parent;

    template <typename V>

      : public SubMapExtender<SubDigraphBase<DGR, NF, AF, false>,

          LEMON_SCOPE_FIX(DigraphAdaptorBase<DGR>, ArcMap<V>)> {

    template <typename V>

      : public SubMapExtender<SubGraphBase<GR, NF, EF, ch>,

          LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, NodeMap<V>)> {

        LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, NodeMap<V>)> Parent;

    template <typename V>

      : public SubMapExtender<SubGraphBase<GR, NF, EF, ch>,

          LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, ArcMap<V>)> {

        LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, ArcMap<V>)> Parent;

    template <typename V>

      : public SubMapExtender<SubGraphBase<GR, NF, EF, ch>,

        LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, EdgeMap<V>)> {

        LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, EdgeMap<V>)> Parent;

    NF* _node_filter;

    EF* _edge_filter;

    void initialize(GR& graph, NF& node_filter, EF& edge_filter) {

    template <typename V>

      : public SubMapExtender<SubGraphBase<GR, NF, EF, false>,

          LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, NodeMap<V>)> {

        LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, NodeMap<V>)> Parent;

    template <typename V>

      : public SubMapExtender<SubGraphBase<GR, NF, EF, false>,

          LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, ArcMap<V>)> {

        LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, ArcMap<V>)> Parent;

    template <typename V>

      : public SubMapExtender<SubGraphBase<GR, NF, EF, false>,

        LEMON_SCOPE_FIX(GraphAdaptorBase<GR>, EdgeMap<V>)> {

    public:

#endif

    typedef DigraphAdaptorExtender<

                     true> > Parent;

    /// Creates a subgraph for the given digraph or graph with the

    /// given node filter map.

      : Parent(), const_true_map()

    {

                    typename enable_if<UndirectedTagIndicator<GR> >::type> :

    public GraphAdaptorExtender<

                   true> > {

    typedef GraphAdaptorExtender<

                   true> > Parent;

#endif

    typedef DigraphAdaptorExtender<

                     AF, false> > Parent;

  class FilterEdges :

    public GraphAdaptorExtender<

                   EF, false> > {

#endif

    typedef GraphAdaptorExtender<

                   EF, false> > Parent;

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

    /// filter map.

      : Parent(), const_true_map() {

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

      bool _forward;

        : _edge(edge), _forward(forward) {}

      ArcMapBase(const UndirectorBase<DGR>& adaptor, const V& value)

          _backward(*adaptor._digraph, value) {}

    typedef typename ItemSetTraits<DGR, Edge>::ItemNotifier EdgeNotifier;

    EdgeNotifier& notifier(Edge) const { return _digraph->notifier(Edge()); }

    typedef EdgeNotifier ArcNotifier;

    ArcNotifier& notifier(Arc) const { return _digraph->notifier(Edge()); }

           typename FM = CM,

           typename TL = Tolerance<typename CM::Value> >

    : public SubDigraph<

        Undirector<const DGR>,

    ResidualDigraph(const DGR& digraph, const CM& capacity,

                    FM& flow, const TL& tolerance = Tolerance())

        _graph(digraph), _node_filter(),

        _forward_filter(capacity, flow, tolerance),

      /// Constructor

        : _adaptor(&adaptor) {}

    /// to get a node map of the split digraph.

    /// Its value type is inherited from the first node map type (\c IN).

    /// \tparam OUT The type of the node map for the out-nodes.

    template <typename IN, typename OUT>

 * This file is a part of LEMON, a generic C++ optimization library.

 *

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

    else throw(ArgParserException(reason));

  }

  void ArgParser::_showHelp(void *p)

  {

 * This file is a part of LEMON, a generic C++ optimization library.

 *

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

      INVALID_OPT   /// Invalid combination of options

    };

  private:

    Reason _reason;

  public:

    ///Constructor

    std::string _command_name;

  private:

    //Bind a function to an option.

    bool _exit_on_problems;

    void _terminate(ArgParserException::Reason reason) const;

    ///Throw instead of exit in case of problems

    {

      _exit_on_problems=false;

 *

 *

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

  /// \brief Default operation traits for the BellmanFord algorithm class.

  /// This operation traits class defines all computational operations

  /// and constants that are used in the Bellman-Ford algorithm.

  /// \see BellmanFordToleranceOperationTraits

  template <

    bool has_inf = std::numeric_limits<V>::has_infinity>

  struct BellmanFordDefaultOperationTraits {

    }

  };

  /// \brief Operation traits for the BellmanFord algorithm class

  /// using tolerance.

  template<typename GR, typename LEN>

  struct BellmanFordDefaultTraits {

    typedef GR Digraph;

    /// BellmanFordToleranceOperationTraits

    typedef BellmanFordDefaultOperationTraits<Value> OperationTraits;

    /// shortest paths.

    /// The type of the map that stores the last

    /// arcs of the shortest paths.

    /// \brief Instantiates a \c PredMap.

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

    /// \ref PredMap.

    /// \brief Instantiates a \c DistMap.

    ///

    /// \ref DistMap.

    static DistMap *createDistMap(const GR& g) {

  };

  /// \brief %BellmanFord algorithm class.

  ///

  /// \ingroup shortest_path

  /// algorithm. The maximum time complexity of the algorithm is

  /// <tt>O(ne)</tt>.

  ///

  /// The arc lengths are passed to the algorithm using a

  /// kind of length. The type of the length values is determined by the

  /// \ref concepts::ReadMap::Value "Value" type of the length map.

    ///The type of the underlying digraph.

    typedef typename TR::Digraph Digraph;

    /// \brief The type of the arc lengths.

    typedef typename TR::LengthMap::Value Value;

    void create_maps() {

      if(!_pred) {

      }

      if(!_dist) {

      }

      if(!_mask) {

      }

    }

  public :

    typedef BellmanFord Create;

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

    template <class T>

      : public BellmanFord< Digraph, LengthMap, SetPredMapTraits<T> > {

      typedef BellmanFord< Digraph, LengthMap, SetPredMapTraits<T> > Create;

    };

    template <class T>

    struct SetDistMapTraits : public Traits {

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

    template <class T>

      : public BellmanFord< Digraph, LengthMap, SetDistMapTraits<T> > {

      typedef BellmanFord< Digraph, LengthMap, SetDistMapTraits<T> > Create;

      typedef T OperationTraits;

    };

    /// \c OperationTraits type.

    ///

      Create;

    };

    ///@}

  protected:

    BellmanFord() {}

    /// \brief Constructor.

    ///

      _pred(0), _local_pred(false),

      _dist(0), _local_dist(false), _mask(0) {}

    ///Destructor.

    ~BellmanFord() {

    BellmanFord &predMap(PredMap &map) {

      if(_local_pred) {

      }

      _pred = ↦

    BellmanFord &distMap(DistMap &map) {

      if(_local_dist) {

      }

      _dist = ↦

    /// \brief Initializes the internal data structures.

    /// Initializes the internal data structures. The optional parameter

    /// is the initial distance of each node.

      create_maps();

      for (NodeIt it(*_gr); it != INVALID; ++it) {

      }

      _process.clear();

      if (OperationTraits::less(value, OperationTraits::infinity())) {

      } else {

      }

    }

    /// \brief Adds a new source node.

    ///

      _dist->set(source, dst);

      if (!(*_mask)[source]) {

      }

    }

    bool processNextRound() {

      for (int i = 0; i < int(_process.size()); ++i) {

      }

      std::vector<Node> nextProcess;

      std::vector<Value> values(_process.size());

      for (int i = 0; i < int(_process.size()); ++i) {

      }

      for (int i = 0; i < int(_process.size()); ++i) {

      }

      _process.swap(nextProcess);

    bool processNextWeakRound() {

      for (int i = 0; i < int(_process.size()); ++i) {

      }

      std::vector<Node> nextProcess;

      for (int i = 0; i < int(_process.size()); ++i) {

      }

      _process.swap(nextProcess);

      int num = countNodes(*_gr) - 1;

      for (int i = 0; i < num; ++i) {

      }

    }

    /// if the digraph contains cycles with negative total length.

    ///

    /// - the shortest path tree (forest),

    /// - the distance of each node from the root(s).

    /// \return \c false if there is a negative cycle in the digraph.

    ///

    /// \pre init() must be called and at least one root node should be

    bool checkedStart() {

      int num = countNodes(*_gr);

      for (int i = 0; i < num; ++i) {

      }

      return _process.empty();

    ///

    /// \pre init() must be called and at least one root node should be

    void limitedStart(int num) {

      for (int i = 0; i < num; ++i) {

      }

    }

    /// \brief Runs the algorithm from the given root node.

    /// This method runs the Bellman-Ford algorithm from the given root

    /// node \c s in order to compute the shortest path to each node.

      start();

    }

    /// \brief Runs the algorithm from the given root node with arc

    /// number limit.

    /// This method runs the Bellman-Ford algorithm from the given root

    /// node \c s in order to compute the shortest path distance for each

      limitedStart(num);

    }

    ///@}

      ///

      /// Constructor for getting the active nodes of the given BellmanFord

      ActiveIt(const BellmanFord& algorithm) : _algorithm(&algorithm)

      {

      ///

      /// Conversion to \c Node.

        return _index >= 0 ? _algorithm->_process[_index] : INVALID;

      }

      ActiveIt& operator++() {

        --_index;

      }

      }

      }

      }

    private:

      const BellmanFord* _algorithm;

      int _index;

    };

    /// \name Query Functions

    /// The result of the Bellman-Ford algorithm can be obtained using these

    /// functions.\n

    /// Either \ref run() or \ref init() should be called before using them.

    ///@{

    /// \brief The shortest path to the given node.

    /// Gives back the shortest path to the given node from the root(s).

    ///

      return Path(*_gr, *_pred, t);

    }

    /// \brief The distance of the given node from the root(s).

    ///

    /// \pre Either \ref run() or \ref init() must be called before

    /// using this function.

    }

    /// \brief Returns a const reference to the node map that stores the

    /// distances of the nodes.

    /// using this function.

    const DistMap &distMap() const { return *_dist;}

    /// \brief Returns a const reference to the node map that stores the

    /// predecessor arcs.

    /// using this function.

    const PredMap &predMap() const { return *_pred; }

    /// \brief Checks if a node is reached from the root(s).

    ///

    /// \brief Gives back a negative cycle.

    /// This function gives back a directed cycle with negative total

    /// length if the algorithm has already found one.

      return cycle;

    }

    ///@}

  };

  /// \brief Default traits class of bellmanFord() function.

  ///

  template <typename GR, typename LEN>

  struct BellmanFordWizardDefaultTraits {

    typedef GR Digraph;

    /// \brief The type of the map that stores the last

    /// arcs of the shortest paths.

    /// The type of the map that stores the last arcs of the shortest paths.

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

    /// \brief Instantiates a \c PredMap.

    /// This function instantiates a \ref PredMap.

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

    /// \brief Instantiates a \c DistMap.

    ///

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

    /// \ref DistMap.

    typedef lemon::Path<Digraph> Path;

  };

  /// \brief Default traits class used by BellmanFordWizard.

  ///

  /// \tparam LEN The type of the length map.

  template <typename GR, typename LEN>

    : public BellmanFordWizardDefaultTraits<GR, LEN> {

    public:

    /// Constructor.

    /// This constructor does not require parameters, it initiates

    /// all of the attributes to default values \c 0.

    /// Constructor.

    /// This constructor requires two parameters,

    /// others are initiated to \c 0.

    /// \param gr The digraph the algorithm runs on.

    /// \param len The length map.

      _pred(0), _dist(0), _path(0), _di(0) {}

  };

  /// \brief Auxiliary class for the function-type interface of the

  /// \ref BellmanFord "Bellman-Ford" algorithm.

    typedef typename Digraph::Arc Arc;

    typedef typename Digraph::OutArcIt ArcIt;

    typedef typename TR::LengthMap LengthMap;

    typedef typename LengthMap::Value Value;

    /// \param gr The digraph the algorithm runs on.

    /// \param len The length map.

      : TR(gr, len) {}

    /// \brief Runs the Bellman-Ford algorithm from the given source node.

    /// This method runs the Bellman-Ford algorithm from the given source

    /// node in order to compute the shortest path to each node.

    void run(Node s) {

           *reinterpret_cast<const LengthMap*>(Base::_length));

      if (Base::_pred) bf.predMap(*reinterpret_cast<PredMap*>(Base::_pred));

      SetPredMapBase(const TR &b) : TR(b) {}

    };

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

    /// the predecessor map.

      return BellmanFordWizard<SetPredMapBase<T> >(*this);

    }

    template<class T>

    struct SetDistMapBase : public Base {

      SetDistMapBase(const TR &b) : TR(b) {}

    };

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

    /// the distance map.

      return *this;

    }

  };

  /// \brief Function type interface for the \ref BellmanFord "Bellman-Ford"

  /// algorithm.

  /// algorithm.

  ///

  /// \ref BellmanFordWizard.

  /// The following examples show how to use these parameters.