Named parameter for setting the Path
type of the found cycles. It must conform to the Path concept and it must have an addFront()
function.
#include <lemon/karp_mmc.h>
Additional Inherited Members | |
Public Types inherited from KarpMmc< GR, CM, SetPathTraits< T > > | |
typedef SetPathTraits< T >::Digraph | Digraph |
The type of the digraph. | |
typedef SetPathTraits< T >::CostMap | CostMap |
The type of the cost map. | |
typedef SetPathTraits< T >::Cost | Cost |
The type of the arc costs. | |
typedef SetPathTraits< T > ::LargeCost | LargeCost |
The large cost type. | |
typedef SetPathTraits< T > ::Tolerance | Tolerance |
The tolerance type. | |
typedef SetPathTraits< T >::Path | Path |
The path type of the found cycles. | |
typedef SetPathTraits< T > | Traits |
The traits class of the algorithm. | |
Public Member Functions inherited from KarpMmc< GR, CM, SetPathTraits< 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. | |