RhodeCode

	lemon/graph_to_eps.h \

	lemon/grid_graph.h \

	lemon/hypercube_graph.h \

	lemon/kruskal.h \

	lemon/math.h \

	lemon/min_cost_arborescence.h \

	lemon/nauty_reader.h \

	lemon/network_simplex.h \

 */

/// \ingroup shortest_path

namespace lemon {

  ///

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

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

    bool integer = std::numeric_limits<typename LEN::Value>::is_integer>

#endif

  {

    /// The type of the digraph

  // Default traits class for integer value types

  template <typename GR, typename LEN>

  {

    typedef GR Digraph;

  /// mean cycle.

  ///

  ///

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

  template < typename GR,

             typename LEN = typename GR::template ArcMap<int>,

#endif

  {

  public:

    ///

    /// The large value type used for internal computations.

    /// it is \c long \c long if the \c Value type is integer,

    /// otherwise it is \c double.

    ///

    /// The path type of the found cycles.

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

    typedef typename TR::Path Path;

    typedef TR Traits;

    template <typename T>

    struct SetLargeValue

    };

    template <typename T>

    struct SetPath

    };

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

    /// \param length The lengths (costs) of the arcs.

      _gr(digraph), _length(length), _cycle_path(NULL), _local_path(false),

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

    /// Destructor.

      if (_local_path) delete _cycle_path;

    }

    ///

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

      if (_local_path) {

        delete _cycle_path;

    }

  ///@}

} //namespace lemon

#include <lemon/smart_graph.h>

#include <lemon/lgf_reader.h>

#include <lemon/path.h>

#include <lemon/concepts/digraph.h>

  {

    typedef concepts::Digraph GR;

    checkConcept<MmcClassConcept<GR, int>, IntMmcAlg>();

      run();

  }