Definitions of randomised greedy algorithms. More...

#include <minlca/greedy.hh>
#include <lemon/random.h>

Include dependency graph for greedy-random.hh:

This graph shows which files directly or indirectly include this file:

Classes
class	minlca::MinLCAGreedyNearestRnd< Graph >
	Randomised greedy nearest colour approach for MinLCA. More...

Namespaces
	minlca
	Default namespace Default namespace for MinLCA algorithms.

Typedefs
template<typename Graph >
using	minlca::MinLCAGreedyNearestRndBfs = MinLCAGreedyBfs< MinLCAGreedyNearestRnd, Graph >
	Class defined to ease the use of MinLCAGreedyNearestRnd with Bfs.

Detailed Description

Definitions of randomised greedy algorithms.

Definition in file greedy-random.hh.

Classes