com.mhhe.clrs2e
Interface MST

All Known Implementing Classes:

Kruskal, Prim

public interface MST

Interface for a class that computes a minimum spanning tree.

Method Summary

com.mhhe.clrs2e.WeightedAdjacencyListGraph

computeMST(com.mhhe.clrs2e.WeightedAdjacencyListGraph g) Computes the minimum spanning tree of a weighted, undirected graph.

Method Detail

computeMST

public com.mhhe.clrs2e.WeightedAdjacencyListGraph computeMST(com.mhhe.clrs2e.WeightedAdjacencyListGraph g)

Computes the minimum spanning tree of a weighted, undirected graph.

Parameters:

g - The undirected graph.

Returns:

The subgraph of g that is a minimum spanning tree.