RhodeCode

	lemon/fib_heap.h \

	lemon/full_graph.h \

	lemon/glpk.h \

	lemon/gomory_hu.h \

	lemon/graph_to_eps.h \

	lemon/grid_graph.h \

	lemon/hypercube_graph.h \

	lemon/kruskal.h \

	lemon/hao_orlin.h \

	lemon/lgf_reader.h \

	lemon/lgf_writer.h \

	lemon/list_graph.h \

	lemon/lp.h \

#include <lemon/path.h>

#include <lemon/math.h>

#include <lemon/static_graph.h>

#include <lemon/adaptors.h>

#include <lemon/circulation.h>

#include <lemon/bellman_ford.h>

namespace lemon {

  /// \addtogroup min_cost_flow_algs

  /// @{

    }

    // Execute the "Minimum Mean Cycle Canceling" method

    void startMinMeanCycleCanceling() {

      typedef SimplePath<StaticDigraph> SPath;

      typedef typename SPath::ArcIt SPathArcIt;

        ::template SetPath<SPath>::Create MMC;

      SPath cycle;

      MMC mmc(_sgr, _cost_map);

      mmc.cycle(cycle);

      buildResidualNetwork();

        // Find the cycle

        mmc.findCycle();

        // Compute delta value

        Value delta = INF;

        for (SPathArcIt a(cycle); a != INVALID; ++a) {

              if (_res_cap[a] == 0) continue;

              curr = _cost[a] + pu - pi[_target[a]];

              if (-curr > epsilon) epsilon = -curr;

            }

          }

        } else {

          typedef typename BellmanFord<StaticDigraph, CostArcMap>

            ::template SetDistMap<CostNodeMap>::Create BF;

          // Set epsilon to the minimum cycle mean

          buildResidualNetwork();

          MMC mmc(_sgr, _cost_map);

          epsilon = -mmc.cycleMean();

          // Compute feasible potentials for the current epsilon

          for (int i = 0; i != int(_cost_vec.size()); ++i) {

            _cost_vec[i] = cycle_size * _cost_vec[i] - cycle_cost;

          }

          BF bf(_sgr, _cost_map);

 * This software is provided "AS IS" with no warranty of any kind,

 * express or implied, and with no claim as to its suitability for any

 * purpose.

 *

 */

/// \ingroup min_mean_cycle

///

/// \file

/// \brief Hartmann-Orlin's algorithm for finding a minimum mean cycle.

#include <lemon/path.h>

#include <lemon/tolerance.h>

#include <lemon/connectivity.h>

namespace lemon {

  ///

  /// \tparam GR The type of the digraph.

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

#ifdef DOXYGEN

#else

#endif

  {

    /// The type of the digraph

    typedef GR Digraph;

    ///

    /// otherwise it is \c double.

    /// The tolerance type used for internal computations

    /// \brief The path type of the found cycles

    ///

    /// The path type of the found cycles.

    /// It must conform to the \ref lemon::concepts::Path "Path" concept

    /// and it must have an \c addFront() function.

    typedef lemon::Path<Digraph> Path;

  };

  {

    typedef GR Digraph;

#ifdef LEMON_HAVE_LONG_LONG

#else

#endif

    typedef lemon::Path<Digraph> Path;

  };

  /// \addtogroup min_mean_cycle

  /// @{

  /// \brief Implementation of the Hartmann-Orlin algorithm for finding

  /// a minimum mean cycle.

  ///

  /// This class implements the Hartmann-Orlin algorithm for finding

  /// \ref amo93networkflows, \ref dasdan98minmeancycle.

  /// It is an improved version of \ref Karp "Karp"'s original algorithm,

  /// it applies an efficient early termination scheme.

  /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e).

  ///

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

  /// map type is \ref concepts::Digraph::ArcMap "GR::ArcMap<int>".

  /// \tparam TR The traits class that defines various types used by the

  /// In most cases, this parameter should not be set directly,

  /// consider to use the named template parameters instead.

#ifdef DOXYGEN

#else

  template < typename GR,

#endif

  {

  public:

    /// The type of the digraph

    typedef typename TR::Digraph Digraph;

    ///

    /// otherwise it is \c double.

    /// The tolerance type

    typedef typename TR::Tolerance Tolerance;

    /// \brief The path type of the found cycles

    ///

    /// The path type of the found cycles.

    /// it is \ref lemon::Path "Path<Digraph>".

    typedef typename TR::Path Path;

    typedef TR Traits;

  private:

    TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);

    // Data sturcture for path data

    struct PathData

    {

      Arc pred;

        dist(d), pred(p) {}

    };

    typedef typename Digraph::template NodeMap<std::vector<PathData> >

      PathDataNodeMap;

  private:

    // The digraph the algorithm runs on

    const Digraph &_gr;

    // Data for storing the strongly connected components

    int _comp_num;

    typename Digraph::template NodeMap<int> _comp;

    std::vector<std::vector<Node> > _comp_nodes;

    std::vector<Node>* _nodes;

    typename Digraph::template NodeMap<std::vector<Arc> > _out_arcs;

    // Data for the found cycles

    bool _curr_found, _best_found;

    int _curr_size, _best_size;

    Node _curr_node, _best_node;

    int _curr_level, _best_level;

    Path *_cycle_path;

    bool _local_path;

    // The processed nodes in the last round

    std::vector<Node> _process;

    Tolerance _tolerance;

    // Infinite constant

  public:

    /// \name Named Template Parameters

    /// @{

    template <typename T>

      typedef lemon::Tolerance<T> Tolerance;

    };

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

    ///

    /// type. It is used for internal computations in the algorithm.

    template <typename T>

    };

    template <typename T>

    struct SetPathTraits : public Traits {

      typedef T Path;

    };

    /// \ref named-templ-param "Named parameter" for setting the \c %Path

    /// type of the found cycles.

    /// It must conform to the \ref lemon::concepts::Path "Path" concept

    /// and it must have an \c addFront() function.

    template <typename T>

    struct SetPath

    };

    /// @}

  protected:

  public:

    /// \brief Constructor.

    ///

    /// The constructor of the class.

    ///

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

      _cycle_path(NULL), _local_path(false), _data(digraph),

    {}

    /// Destructor.

      if (_local_path) delete _cycle_path;

    }

    /// \brief Set the path structure for storing the found cycle.

    ///

    /// This function sets an external path structure for storing the

    /// found cycle.

    ///

    /// If you don't call this function before calling \ref run() or

    /// structure. The destuctor deallocates this automatically

    /// allocated object, of course.

    ///

    /// \note The algorithm calls only the \ref lemon::Path::addFront()

    /// "addFront()" function of the given path structure.

    ///

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

      if (_local_path) {

        delete _cycle_path;

        _local_path = false;

      }

      _cycle_path = &path;

      return *this;

    /// \brief Set the tolerance used by the algorithm.

    ///

    /// This function sets the tolerance object used by the algorithm.

    ///

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

      _tolerance = tolerance;

      return *this;

    }

    /// \brief Return a const reference to the tolerance.

    ///

      return _tolerance;

    }

    /// \name Execution control

    /// The simplest way to execute the algorithm is to call the \ref run()

    /// function.\n

    /// @{

    /// \brief Run the algorithm.

    ///

    /// This function runs the algorithm.

    /// It can be called more than once (e.g. if the underlying digraph

    ///

    /// \return \c true if a directed cycle exists in the digraph.

    ///

    /// \note <tt>mmc.run()</tt> is just a shortcut of the following code.

    /// \code

    /// \endcode

    bool run() {

    }

    /// \brief Find the minimum cycle mean.

    ///

    /// cycles in the digraph.

    ///

    /// \return \c true if a directed cycle exists in the digraph.

      // Initialization and find strongly connected components

      init();

      findComponents();

      // Find the minimum cycle mean in the components

      for (int comp = 0; comp < _comp_num; ++comp) {

        if (!initComponent(comp)) continue;

        processRounds();

        // Update the best cycle (global minimum mean cycle)

        if ( _curr_found && (!_best_found || 

          _best_found = true;

          _best_size = _curr_size;

          _best_node = _curr_node;

          _best_level = _curr_level;

        }

      }

      return _best_found;

    }

    /// \brief Find a minimum mean directed cycle.

    ///

    ///

    /// \return \c true if a directed cycle exists in the digraph.

    ///

    bool findCycle() {

      if (!_best_found) return false;

      IntNodeMap reached(_gr, -1);

      int r = _best_level + 1;

      Node u = _best_node;

      while (reached[u] < 0) {

        reached[u] = --r;

        u = _gr.source(_data[u][r].pred);

      }

      r = reached[u];

      Arc e = _data[u][r].pred;

      _cycle_path->addFront(e);

      _best_size = 1;

      Node v;

      while ((v = _gr.source(e)) != u) {

        e = _data[v][--r].pred;

        _cycle_path->addFront(e);

        ++_best_size;

      }

      return true;

    }

    /// @}

    /// The results of the algorithm can be obtained using these

    /// functions.\n

    /// The algorithm should be executed before using them.

    /// @{

    ///

    ///

    /// using this function.

    }

    /// \brief Return the number of arcs on the found cycle.

    ///

    /// This function returns the number of arcs on the found cycle.

    ///

    /// using this function.

      return _best_size;

    }

    ///

    ///

    /// \note <tt>alg.cycleMean()</tt> is just a shortcut of the

    /// following code.

    /// \code

    /// \endcode

    ///

    /// using this function.

    double cycleMean() const {

    }

    /// \brief Return the found cycle.

    ///

    /// This function returns a const reference to the path structure

    /// storing the found cycle.

      if (!_cycle_path) {

        _local_path = true;

        _cycle_path = new Path;

      }

      _cycle_path->clear();

      _best_found = false;

      _best_size = 1;

      _cycle_path->clear();

      for (NodeIt u(_gr); u != INVALID; ++u)

        _data[u].clear();

    }

        _data[(*_nodes)[i]].resize(n + 1, PathData(INF));

      }

      return true;

    }

    // Process all rounds of computing path data for the current component.

    // node to node v containing exactly k arcs.

    void processRounds() {

      Node start = (*_nodes)[0];

      _data[start][0] = PathData(0);

      _process.clear();

      _process.push_back(start);

    // Process one round and rebuild _process

    void processNextBuildRound(int k) {

      std::vector<Node> next;

      Node u, v;

      Arc e;

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

        u = _process[i];

        for (int j = 0; j < int(_out_arcs[u].size()); ++j) {

          e = _out_arcs[u][j];

          v = _gr.target(e);

          if (_tolerance.less(d, _data[v][k].dist)) {

            if (_data[v][k].dist == INF) next.push_back(v);

            _data[v][k] = PathData(d, e);

          }

        }

      }

    }

    // Process one round using _nodes instead of _process

    void processNextFullRound(int k) {

      Node u, v;

      Arc e;

      for (int i = 0; i < int(_nodes->size()); ++i) {

        u = (*_nodes)[i];

        for (int j = 0; j < int(_out_arcs[u].size()); ++j) {

          e = _out_arcs[u][j];

          v = _gr.target(e);

          if (_tolerance.less(d, _data[v][k].dist)) {

            _data[v][k] = PathData(d, e);

          }

        }

      }

    }

    // Check early termination

    bool checkTermination(int k) {

      typedef std::pair<int, int> Pair;

      typename GR::template NodeMap<Pair> level(_gr, Pair(-1, 0));

      int n = _nodes->size();

      int size;

      Node u;

      // Search for cycles that are already found

      _curr_found = false;

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

        u = (*_nodes)[i];

        if (_data[u][k].dist == INF) continue;

        for (int j = k; j >= 0; --j) {

          if (level[u].first == i && level[u].second > 0) {

            // A cycle is found

            size = level[u].second - j;

              _curr_size = size;

              _curr_node = u;

              _curr_level = level[u].second;

              _curr_found = true;

            }

          }

	    u = _gr.source(_data[u][j].pred);

	  }

        }

      }

      // If at least one cycle is found, check the optimality condition

      if (_curr_found && k < n) {

        // Find node potentials

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

          u = (*_nodes)[i];

          pi[u] = INF;

          for (int j = 0; j <= k; ++j) {

            if (_data[u][j].dist < INF) {

              if (_tolerance.less(d, pi[u])) pi[u] = d;

            }

          }

        }

        // Check the optimality condition for all arcs

        bool done = true;

        for (ArcIt a(_gr); a != INVALID; ++a) {

                              pi[_gr.target(a)] - pi[_gr.source(a)]) ) {

            done = false;

            break;

          }

        }

        return done;

      }

      return (k == n);

    }

  ///@}

} //namespace lemon

 * This software is provided "AS IS" with no warranty of any kind,

 * express or implied, and with no claim as to its suitability for any

 * purpose.

 *

 */

/// \ingroup min_mean_cycle

///

/// \file

/// \brief Howard's algorithm for finding a minimum mean cycle.

#include <lemon/path.h>

#include <lemon/tolerance.h>

#include <lemon/connectivity.h>

namespace lemon {

  ///

  /// \tparam GR The type of the digraph.

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

#ifdef DOXYGEN

#else

#endif

  {

    /// The type of the digraph

    typedef GR Digraph;

    ///

    /// otherwise it is \c double.

    /// The tolerance type used for internal computations

    /// \brief The path type of the found cycles

    ///

    /// The path type of the found cycles.

    /// It must conform to the \ref lemon::concepts::Path "Path" concept

    /// and it must have an \c addBack() function.

    typedef lemon::Path<Digraph> Path;

  };

  {

    typedef GR Digraph;

#ifdef LEMON_HAVE_LONG_LONG

#else

#endif

    typedef lemon::Path<Digraph> Path;

  };

  /// \addtogroup min_mean_cycle

  /// @{

  /// \brief Implementation of Howard's algorithm for finding a minimum

  /// mean cycle.

  ///

  /// This class implements Howard's policy iteration algorithm for finding

  /// \ref amo93networkflows, \ref dasdan98minmeancycle.

  /// This class provides the most efficient algorithm for the

  /// minimum mean cycle problem, though the best known theoretical

  /// bound on its running time is exponential.

  ///

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

  /// map type is \ref concepts::Digraph::ArcMap "GR::ArcMap<int>".

  /// \tparam TR The traits class that defines various types used by the

  /// In most cases, this parameter should not be set directly,

  /// consider to use the named template parameters instead.

#ifdef DOXYGEN

#else

  template < typename GR,

#endif

  {

  public:

    /// The type of the digraph

    typedef typename TR::Digraph Digraph;

    ///

    /// otherwise it is \c double.

    /// The tolerance type

    typedef typename TR::Tolerance Tolerance;

    /// \brief The path type of the found cycles

    ///

    /// The path type of the found cycles.

    /// it is \ref lemon::Path "Path<Digraph>".

    typedef typename TR::Path Path;

    typedef TR Traits;

  private:

    TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);

    // The digraph the algorithm runs on

    const Digraph &_gr;

    // Data for the found cycles

    bool _curr_found, _best_found;

    int _curr_size, _best_size;

    Node _curr_node, _best_node;

    Path *_cycle_path;

    bool _local_path;

    // Internal data used by the algorithm

    typename Digraph::template NodeMap<Arc> _policy;

    typename Digraph::template NodeMap<bool> _reached;

    typename Digraph::template NodeMap<int> _level;

    // Data for storing the strongly connected components

    int _comp_num;

    typename Digraph::template NodeMap<int> _comp;

    std::vector<std::vector<Node> > _comp_nodes;

    std::vector<Node>* _nodes;

    std::vector<Node> _queue;

    int _qfront, _qback;

    Tolerance _tolerance;

    // Infinite constant

  public:

    /// \name Named Template Parameters

    /// @{

    template <typename T>

      typedef lemon::Tolerance<T> Tolerance;

    };

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

    ///

    /// type. It is used for internal computations in the algorithm.

    template <typename T>

    };

    template <typename T>

    struct SetPathTraits : public Traits {

      typedef T Path;

    };

    /// \ref named-templ-param "Named parameter" for setting the \c %Path

    /// type of the found cycles.

    /// It must conform to the \ref lemon::concepts::Path "Path" concept

    /// and it must have an \c addBack() function.

    template <typename T>

    struct SetPath

    };

    /// @}

  protected:

  public:

    /// \brief Constructor.

    ///

    /// The constructor of the class.

    ///

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

      _policy(digraph), _reached(digraph), _level(digraph), _dist(digraph),