greedy.hh File Reference

#include <minlca/base.hh>
#include <list>
#include <vector>
#include <lemon/connectivity.h>
#include <lemon/bfs.h>
#include <utils/utils.hh>
#include <iostream>
#include <limits>
#include <cstdlib>

Include dependency graph for greedy.hh:

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

Go to the source code of this file.

Classes
class	minlca::MinLCAGreedy< Graph >
	Base class for greedy algorithms. More...
class	minlca::MinLCAGreedyBfs< Greedy, Graph >
	Class for greedy algorithms using a breadth-first search. More...
class	minlca::MinLCAGreedyNearest< Graph >
	Greedy nearest colour approach for MinLCA. More...
class	minlca::MinLCAGreedyLeastCost< Graph >
	Greedy nearest colour approach for MinLCA. More...

Namespaces
	minlca
	Default namespace Default namespace for MinLCA algorithms.

Typedefs
template<typename Graph >
using	minlca::MinLCAGreedyNearestBfs = MinLCAGreedyBfs< MinLCAGreedyNearest, Graph >
	Class defined to ease the use of MinLCAGreedyNearest with Bfs.
template<typename Graph >
using	minlca::MinLCAGreedyLeastCostBfs = MinLCAGreedyBfs< MinLCAGreedyLeastCost, Graph >
	Class defined to ease the use of MinLCAGreedyLeastCost with Bfs.

Detailed Description

Definitions of greedy algorithms for MinLCA

Definition in file greedy.hh.