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).

 *

  // exit(1) on these cases, but this makes Valgrind falsely warn

  // about memory leaks.

  ap.throwOnProblems();

  // Perform the parsing process

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

  // The try {} construct is necessary only if the ap.trowOnProblems()

 *

 * 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).

 *

and <b>O</b>ptimization in <b>N</b>etworks</i>.

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

data structures and algorithms with focus on combinatorial optimization

<b>

LEMON is an <a class="el" href="http://opensource.org/">open&nbsp;source</a>

\ref license "license terms".

</b>

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

Combinatorial Optimization</a> \ref egres

at the Operations Research Department of the

 *

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

 *

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

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

 *

   - \f$\pi(u)\leq 0\f$;

   - 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[ cost^\pi(uv) = cost(uv) + \pi(u) - \pi(v).\f]

    sup(u) \quad \forall u\in V \f]

\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

could be supplies that are not carried out from the supply

 *

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

 *

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

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

 *

    void initialize(DGR& digraph, NF& node_filter, AF& arc_filter) {

      Parent::initialize(digraph);

      _node_filter = &node_filter;

    }

  public:

  public:

    template <typename V>

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

    public:

      typedef V Value;

    };

    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;

    void initialize(DGR& digraph, NF& node_filter, AF& arc_filter) {

      Parent::initialize(digraph);

      _node_filter = &node_filter;

    }

  public:

    }

    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;

    public:

    };

    template <typename V>

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

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

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

    }

    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;

    public:

    };

    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;

    public:

    };

    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;

    public:

  protected:

    NF* _node_filter;

    EF* _edge_filter;

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

      Parent::initialize(graph);

    }

    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;

    public:

    };

    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;

    public:

    };

    template <typename V>

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

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

    public:

      typedef V Value;

                     true> > {

#endif

    typedef DigraphAdaptorExtender<

                     true> > Parent;

  public:

    ///

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

    /// given node filter map.

      : Parent(), const_true_map()

    {

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

  class FilterNodes<GR, NF,

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

    public GraphAdaptorExtender<

                   true> > {

    typedef GraphAdaptorExtender<

                   true> > Parent;

  public:

                     AF, false> > {

#endif

    typedef DigraphAdaptorExtender<

                     AF, false> > Parent;

  public:

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

  class FilterEdges :

    public GraphAdaptorExtender<

                   EF, false> > {

#endif

    typedef GraphAdaptorExtender<

                   EF, false> > Parent;

  public:

    ///

    /// 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);

    }

      Edge _edge;

      bool _forward;

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

    public:

        _forward(*adaptor._digraph), _backward(*adaptor._digraph) {}

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

          _backward(*adaptor._digraph, value) {}

      void set(const Arc& a, const V& 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 CM = typename DGR::template ArcMap<int>,

           typename FM = CM,

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

    : public SubDigraph<

        Undirector<const DGR>,

        ConstMap<typename DGR::Node, Const<bool, true> >,

    /// digraph, the capacity map, the flow map, and a tolerance object.

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

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

        _graph(digraph), _node_filter(),

        _forward_filter(capacity, flow, tolerance),

        _backward_filter(capacity, flow, tolerance),

      typedef typename CapacityMap::Value Value;

      /// Constructor

        : _adaptor(&adaptor) {}

      /// Returns the value associated with the given residual arc

    /// This map adaptor class adapts two node maps of the original digraph

    /// 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>

    class CombinedNodeMap {

 *

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

 *

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

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

 *

      exit(1);

    else throw(ArgParserException(reason));

  }

  void ArgParser::_showHelp(void *p)

  {

    (static_cast<ArgParser*>(p))->showHelp();

 *

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

 *

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

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

 *

      UNKNOWN_OPT,  /// Unknown option was given

      INVALID_OPT   /// Invalid combination of options

    };

  private:

    Reason _reason;

  public:

    ///Constructor

    ArgParserException(Reason r) throw() : _reason(r) {}

    std::vector<std::string> _file_args;

    std::string _command_name;

  private:

    //Bind a function to an option.

                    void (*func)(void *),void *data);

    bool _exit_on_problems;

    void _terminate(ArgParserException::Reason reason) const;

  public:

    const std::vector<std::string> &files() const { return _file_args; }

    ///Throw instead of exit in case of problems

    {

      _exit_on_problems=false;

    }

 *

 *

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

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

 *

namespace lemon {

  /// \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.

  /// The default implementation is based on the \c numeric_limits class.

  ///

  /// \see BellmanFordToleranceOperationTraits

  template <

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

  struct BellmanFordDefaultOperationTraits {

    /// \brief Value type for the algorithm.

      return left < right;

    }

  };

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

  /// using tolerance.

  ///

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

  template<typename GR, typename LEN>

  struct BellmanFordDefaultTraits {

    typedef GR Digraph;

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

    /// \see BellmanFordDefaultOperationTraits,

    /// BellmanFordToleranceOperationTraits

    typedef BellmanFordDefaultOperationTraits<Value> OperationTraits;

    /// 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.

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

    /// \brief Instantiates a \c PredMap.

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

    /// \ref PredMap.

    static PredMap *createPredMap(const GR& g) {

    /// \brief Instantiates a \c DistMap.

    ///

    /// \ref DistMap.

    static DistMap *createDistMap(const GR& g) {

      return new DistMap(g);

    }

  };

  /// \brief %BellmanFord algorithm class.

  ///

  /// \ingroup shortest_path

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

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

  ///

  /// algorithm instead, since it is more efficient.

  ///

  /// 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;

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

    // Creates the maps if necessary.

    void create_maps() {

      if(!_pred) {

      }

      if(!_dist) {

      }

      if(!_mask) {

        _mask = new MaskMap(*_gr);

      }

    }

  public :

    typedef BellmanFord Create;

    /// \name Named Template Parameters

    /// \c PredMap type.

    /// 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 {

      typedef T DistMap;

    /// \c DistMap type.

    /// 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;

    };

    struct SetOperationTraitsTraits : public Traits {

      typedef T OperationTraits;

    };

    /// \c OperationTraits type.

    ///

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

      typedef BellmanFord< Digraph, LengthMap, SetOperationTraitsTraits<T> >

      Create;

    };

    ///@}

  protected:

    BellmanFord() {}

    /// \brief Constructor.

    ///

    /// Constructor.

      _gr(&g), _length(&length),

      _pred(0), _local_pred(false),

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

    ///Destructor.

    ~BellmanFord() {

      if(_local_pred) delete _pred;

    /// \return <tt>(*this)</tt>

    BellmanFord &predMap(PredMap &map) {

      if(_local_pred) {

      }

      _pred = ↦

      return *this;

    /// \return <tt>(*this)</tt>

    BellmanFord &distMap(DistMap &map) {

      if(_local_dist) {

      }

      _dist = ↦

      return *this;

    ///@{

    /// \brief Initializes the internal data structures.

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

    /// is the initial distance of each node.

    void init(const Value value = OperationTraits::infinity()) {

      create_maps();

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

      }

      _process.clear();

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

      } else {

      }

    }

    /// \brief Adds a new source node.

    ///

    /// This function adds a new source node. The optional second parameter

    void addSource(Node source, Value dst = OperationTraits::zero()) {

      _dist->set(source, dst);

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

      }

    }

    /// \see ActiveIt

    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);

      return _process.empty();

    /// \see ActiveIt

    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);

      return _process.empty();

    void start() {

      int num = countNodes(*_gr) - 1;

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

      }

    }

    /// in order to compute the shortest path to each node and also checks

    /// 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();

    }

    /// and build the path manually.

    ///

    /// \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.

    ///

      addSource(s);

      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

    /// node using only the paths consisting of at most \c num arcs.

      addSource(s);

      limitedStart(num);

    }

    ///@}

    /// \brief LEMON iterator for getting the active nodes.

      /// \brief Constructor.

      ///

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

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

      {

        _index = _algorithm->_process.size() - 1;

      /// \brief Conversion to \c Node.

      ///

      /// Conversion to \c Node.

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

      }

      /// Increment operator.

      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).

    ///

    /// \warning \c t should be reached from the root(s).

    {

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

    }

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

    ///

    /// Returns 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.

    ///

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

    /// using this function.

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

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

    /// predecessor arcs.

    ///

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

    /// using this function.

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

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

    ///

    /// Returns \c true if \c v 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.

    /// Otherwise it gives back an empty path.