RhodeCode

	lemon/graph_to_eps.h \

	lemon/grid_graph.h \

	lemon/hypercube_graph.h \

	lemon/kruskal.h \

	lemon/hao_orlin.h \

#include <lemon/circulation.h>

#include <lemon/bellman_ford.h>

namespace lemon {

      typedef SimplePath<StaticDigraph> SPath;

      typedef typename SPath::ArcIt SPathArcIt;

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

      mmc.cycle(cycle);

      buildResidualNetwork();

        // Find the cycle

        mmc.findCycle();

          }

        } else {

          typedef typename BellmanFord<StaticDigraph, CostArcMap>

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

          buildResidualNetwork();

          MMC mmc(_sgr, _cost_map);

          epsilon = -mmc.cycleMean();

          // Compute feasible potentials for the current epsilon

 */

/// \ingroup min_mean_cycle

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

  };

  {

    typedef GR Digraph;

#ifdef LEMON_HAVE_LONG_LONG

#else

#endif

    typedef lemon::Path<Digraph> Path;

  };

  ///

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

  ///

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

    ///

    /// The path type of the found cycles.

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

    typedef typename TR::Path Path;

    typedef TR Traits;

    struct PathData

    {

      Arc pred;

        dist(d), pred(p) {}

    };

    // The digraph the algorithm runs on

    const Digraph &_gr;

    // Data for storing the strongly connected components

    // Data for the found cycles

    bool _curr_found, _best_found;

    int _curr_size, _best_size;

    Node _curr_node, _best_node;

    // Infinite constant

  public:

    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 SetPath

    };

  protected:

  public:

    ///

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

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

    {}

    /// Destructor.

      if (_local_path) delete _cycle_path;

    }

    ///

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

    /// structure. The destuctor deallocates this automatically

    /// allocated object, of course.

    ///

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

      if (_local_path) {

        delete _cycle_path;

    ///

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

      _tolerance = tolerance;

      return *this;

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

    /// function.\n

    /// @{

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

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

        if ( _curr_found && (!_best_found || 

          _best_found = true;

          _best_size = _curr_size;

          _best_node = _curr_node;

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

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

      _cycle_path->addFront(e);

      _best_size = 1;

      Node v;

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

        _cycle_path->addFront(e);

        ++_best_size;

      }

    /// @{

    ///

    ///

    /// using this function.

    }

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

    }

      _cycle_path->clear();

      _best_found = false;

      _best_size = 1;

      _cycle_path->clear();

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

    // node to node v containing exactly k arcs.

    void processRounds() {

      Node u, v;

      Arc e;

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

        u = _process[i];

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

      Node u, v;

      Arc e;

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

        u = (*_nodes)[i];

          e = _out_arcs[u][j];

          v = _gr.target(e);

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

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

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

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

      int n = _nodes->size();

      int size;

      Node u;

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

            // A cycle is found

            size = level[u].second - j;

              _curr_size = size;

              _curr_node = u;

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

      if (_curr_found && k < n) {

        // Find node potentials

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

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

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

            }

        bool done = true;

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

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

            done = false;

    }

  ///@}

} //namespace lemon

 */

/// \ingroup min_mean_cycle

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

  };

  {

    typedef GR Digraph;

#ifdef LEMON_HAVE_LONG_LONG

#else

#endif

    typedef lemon::Path<Digraph> Path;

  };

  ///

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

  /// \ref amo93networkflows, \ref dasdan98minmeancycle.

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

  ///

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

    ///

    /// The path type of the found cycles.

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

    typedef typename TR::Path Path;

    typedef TR Traits;

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

    typename Digraph::template NodeMap<bool> _reached;

    typename Digraph::template NodeMap<int> _level;

    // Data for storing the strongly connected components

    // Infinite constant

  public:

    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 SetPath

    };

  protected:

  public:

    ///

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

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

      _comp(digraph), _in_arcs(digraph),

    {}

    /// Destructor.

      if (_local_path) delete _cycle_path;

    }

    ///

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

    /// structure. The destuctor deallocates this automatically

    /// allocated object, of course.

    ///

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

      if (_local_path) {

        delete _cycle_path;

    ///

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

      _tolerance = tolerance;

      return *this;

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

    /// function.\n

    /// @{

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

      // Initialize and find strongly connected components

      init();

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

        if ( _curr_found && (!_best_found ||

          _best_found = true;

          _best_size = _curr_size;

          _best_node = _curr_node;

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

    /// @{

    ///

    ///

    /// using this function.

    }

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

    }

      _queue.resize(countNodes(_gr));

      _best_found = false;

      _best_size = 1;

      _cycle_path->clear();

          e = _in_arcs[v][j];

          u = _gr.source(e);

            _policy[u] = e;

          }

        _level[(*_nodes)[i]] = -1;

      }

      int csize;

      Node u, v;

        if (_level[u] == i) {

          // A cycle is found

          csize = 1;

          for (v = u; (v = _gr.target(_policy[v])) != u; ) {

            ++csize;

          }

          if ( !_curr_found ||

            _curr_found = true;

            _curr_size = csize;

            _curr_node = u;

          if (_policy[u] == e && !_reached[u]) {

            _reached[u] = true;

            _queue[++_qback] = u;

          }

            _reached[u] = true;

            _policy[u] = e;

            _queue[++_qback] = u;

          }

          e = _in_arcs[v][j];

          u = _gr.source(e);

          if (_tolerance.less(delta, _dist[u])) {

            _dist[u] = delta;

    }

  ///@}

} //namespace lemon

 */

/// \ingroup min_mean_cycle

namespace lemon {

  ///

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

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