Version 5.0 The LEDA User Manual

12.11 Minimum Spanning Trees ( min span )
list SPANNING TREE(const graph& G)
SPANNING TREE takes as argument a graph
G(V, E). It computes a spanning tree T of the underlying
undirected graph, SPANNING TREE returns
the list of edges of T . The algorithm ([58]) has running
time O(|V | + |E|).
void SPANNING TREE1(graph& G)
SPANNING TREE takes as argument a graph
G(V, E). It computes a spanning tree T of the underlying
undirected graph by deleting the edges in G
that do not belong to T . The algorithm ([58]) has
running time O(|V | + |E|).
list
MIN SPANNING TREE(const graph& G, const edge array& cost)
MIN SPANNING TREE takes as argument an undirected
graph G(V, E) and an edge array cost giving
for each edge an integer cost. It computes a
minimum spanning tree T of G, i.e., a spanning
tree such that the sum of all edge costs is minimal.
MIN SPANNING TREE returns the list of edges of T .
The algorithm ([52]) has running time O(|E| log |V |).
list MIN SPANNING TREE(const graph& G,
const leda cmp base& cmp)
A variant using a compare object to compare edge
costs.
list MIN SPANNING TREE(const graph& G, int (∗cmp)(const edge& ,
const edge& ))
A variant using a compare function to compare edge
costs.