#include <graphalgorithms.H>
template<class GT , class Distance = DefaultDistance<GT>, class Cmp = std::less<typename Distance::Type>>
template<class GT , class Distance = DefaultDistance<GT>, class Cmp = std::less<typename Distance::Type>>
template<class GT , class Distance = DefaultDistance<GT>, class Cmp = std::less<typename Distance::Type>>
template<class GT , class Distance = DefaultDistance<GT>, class Cmp = std::less<typename Distance::Type>>
Designar::Prim< GT, Distance, Cmp >::Prim |
( |
Distance && |
_distance = Distance() , |
|
|
Cmp && |
_cmp = Cmp() |
|
) |
| |
|
inline |
template<class GT , class Distance , class Cmp >
GT Designar::Prim< GT, Distance, Cmp >::build_min_spanning_tree |
( |
const GT & |
g, |
|
|
Node< GT > * |
start |
|
) |
| |
template<class GT , class Distance = DefaultDistance<GT>, class Cmp = std::less<typename Distance::Type>>
GT Designar::Prim< GT, Distance, Cmp >::build_min_spanning_tree |
( |
const GT & |
g | ) |
|
|
inline |
template<class GT , class Distance = DefaultDistance<GT>, class Cmp = std::less<typename Distance::Type>>
void Designar::Prim< GT, Distance, Cmp >::paint_min_spanning_tree |
( |
const GT & |
g, |
|
|
Node< GT > * |
start |
|
) |
| |
|
inline |
template<class GT , class Distance = DefaultDistance<GT>, class Cmp = std::less<typename Distance::Type>>
void Designar::Prim< GT, Distance, Cmp >::paint_min_spanning_tree |
( |
const GT & |
g | ) |
|
|
inline |
The documentation for this class was generated from the following file: