Template Function ADS::prim(const G&, int, Frontier)

• Defined in File MinimumSpanningTree.h

Function Documentation

template<Graph G>
std::vector<int> ADS::prim(const G &g, int r, Frontier how = Frontier::HEAP)

prim(): the parents of the tree from r, NIL for r and the nodes out of its component; how is LIST, HEAP or FIBONACCI

Pre:

the graph is unoriented, r is a node, how is a priority queue

Post:

a minimum spanning tree of the component of r (audit)