This group describes the algorithms for finding a minimum cost spanning tree in a graph
|
Files |
file | fredman_tarjan.h |
| FredmanTarjan algorithm to compute minimum spanning forest.
|
file | kruskal.h |
| Kruskal's algorithm to compute a minimum cost tree.
|
file | min_cost_arborescence.h |
| Minimum Cost Arborescence algorithm.
|
file | prim.h |
| Prim algorithm to compute minimum spanning tree.
|
Classes |
class | FredmanTarjan |
| FredmanTarjan algorithm class to find a minimum spanning tree. More...
|
class | Kruskal |
| Kruskal's algorithm to find a minimum cost tree of a graph. More...
|
class | MinCostArborescence |
| MinCostArborescence algorithm class. More...
|
class | Prim |
| Prim algorithm class to find a minimum spanning tree. More...
|
Functions |
template<class Graph, class CostMap, class TreeMap> |
void | fredmanTarjan (const Graph &graph, const CostMap &cost, TreeMap &tree) |
| Function type interface for FredmanTarjan algorithm.
|
template<class Graph, class In, class Out> |
Value | kruskal (GR const &g, const In &in, Out &out) |
| Kruskal's algorithm to find a minimum cost tree of a graph.
|
template<typename Graph, typename CostMap, typename ArborescenceMap> |
CostMap::Value | minCostArborescence (const Graph &graph, const CostMap &cost, typename Graph::Node source, ArborescenceMap &arborescence) |
| Function type interface for MinCostArborescence algorithm.
|
template<class Graph, class CostMap, class TreeMap> |
CostMap::Value | prim (const Graph &graph, const CostMap &cost, TreeMap &tree) |
| Function type interface for Prim algorithm.
|
template<class Graph, class CostMap, class TreeMap> |
CostMap::Value | prim (const Graph &graph, const CostMap &cost) |
| Function type interface for Prim algorithm.
|