The CyMeAlg Software (Release 0.01)
Namespaces | Functions
cyclemean.h File Reference

This header file contains an implementation of a few variants of algorithms for the computation of the minimum cycle mean of a digraph. More...

#include "chomp/system/config.h"
#include "chomp/system/textfile.h"

Go to the source code of this file.

Namespaces

 cymealg
 

Functions

template<class wType >
wType cymealg::minMeanCycleWeight (const diGraph< wType > &g, diGraph< wType > *transposed=0)
 Runs the Karp algorithm for each strongly connected component of the graph and returns the minimum mean cycle weight, which can be negative. More...
 
template<class wType , class roundType >
wType cymealg::minMeanCycleWeight (const diGraph< wType > &g, const roundType &rounding, diGraph< wType > *transposed)
 A version of Karp algorithm modified for the purpose of interval arithmetic to provide the correct lower bound for the minimum mean cycle weight in a graph. More...
 
template<class wType , class roundType >
wType cymealg::minMeanCycleWeightMem (const diGraph< wType > &g, const roundType &rounding, diGraph< wType > *transposed)
 A rigorous numerics version of Karp algorithm modified in such a way that the memory usage is minimized, at the cost of slower execution (up to twice slower). More...
 

Detailed Description

This header file contains an implementation of a few variants of algorithms for the computation of the minimum cycle mean of a digraph.

Author
Pawel Pilarczyk

Definition in file cyclemean.h.