public class KruskalMST extends Object
KruskalMST
class represents a data type for computing a
minimum spanning tree in an edgeweighted graph.
The edge weights can be positive, zero, or negative and need not
be distinct. If the graph is not connected, it computes a minimum
spanning forest, which is the union of minimum spanning trees
in each connected component. The weight()
method returns the
weight of a minimum spanning tree and the edges()
method
returns its edges.
This implementation uses Krusal's algorithm and the unionfind data type. The constructor takes Θ(E log E) time in the worst case. Each instance method takes Θ(1) time. It uses Θ(E) extra space (not including the graph).
This weight()
method correctly computes the weight of the MST
if all arithmetic performed is without floatingpoint rounding error
or arithmetic overflow.
This is the case if all edge weights are nonnegative integers
and the weight of the MST does not exceed 2^{52}.
For additional documentation,
see Section 4.3 of
Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.
For alternate implementations, see LazyPrimMST
, PrimMST
,
and BoruvkaMST
.
Constructor and Description 

KruskalMST(EdgeWeightedGraph G)
Compute a minimum spanning tree (or forest) of an edgeweighted graph.

Modifier and Type  Method and Description 

Iterable<Edge> 
edges()
Returns the edges in a minimum spanning tree (or forest).

static void 
main(String[] args)
Unit tests the
KruskalMST data type. 
double 
weight()
Returns the sum of the edge weights in a minimum spanning tree (or forest).

public KruskalMST(EdgeWeightedGraph G)
G
 the edgeweighted graphpublic Iterable<Edge> edges()
public double weight()
public static void main(String[] args)
KruskalMST
data type.args
 the commandline arguments