KarpMmc< GR, CM, TR >::SetLargeCost< T > Struct Template Reference

Detailed Description

template<typename GR, typename CM, typename TR>
template<typename T>
struct lemon::KarpMmc< GR, CM, TR >::SetLargeCost< T >

Named parameter for setting LargeCost type. It is used for internal computations in the algorithm.

#include <lemon/karp_mmc.h>

Inheritance diagram for KarpMmc< GR, CM, TR >::SetLargeCost< T >:

Additional Inherited Members
Public Types inherited from KarpMmc< GR, CM, SetLargeCostTraits< T > >
typedef SetLargeCostTraits< T > ::Digraph	Digraph
	The type of the digraph.
typedef SetLargeCostTraits< T > ::CostMap	CostMap
	The type of the cost map.
typedef SetLargeCostTraits< T > ::Cost	Cost
	The type of the arc costs.
typedef SetLargeCostTraits< T > ::LargeCost	LargeCost
	The large cost type.
typedef SetLargeCostTraits< T > ::Tolerance	Tolerance
	The tolerance type.
typedef SetLargeCostTraits< T > ::Path	Path
	The path type of the found cycles.
typedef SetLargeCostTraits< T >	Traits
	The traits class of the algorithm.
Public Member Functions inherited from KarpMmc< GR, CM, SetLargeCostTraits< T > >
	KarpMmc (const Digraph &digraph, const CostMap &cost)
	Constructor.
	~KarpMmc ()
	Destructor.
KarpMmc &	cycle (Path &path)
	Set the path structure for storing the found cycle.
KarpMmc &	tolerance (const Tolerance &tolerance)
	Set the tolerance used by the algorithm.
const Tolerance &	tolerance () const
	Return a const reference to the tolerance.
const Path &	cycle () const
	Return the found cycle.
Cost	cycleCost () const
	Return the total cost of the found cycle.
int	cycleSize () const
	Return the number of arcs on the found cycle.
double	cycleMean () const
	Return the mean cost of the found cycle.
bool	run ()
	Run the algorithm.
bool	findCycleMean ()
	Find the minimum cycle mean.
bool	findCycle ()
	Find a minimum mean directed cycle.