KruskalMST (Algorithms 4/e)

Object
- edu.princeton.cs.algs4.KruskalMST

```
public class KruskalMST
extends Object
```
The KruskalMST class represents a data type for computing a minimum spanning tree in an edge-weighted 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 Kruskal's algorithm and the union-find 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 floating-point rounding error or arithmetic overflow. This is the case if all edge weights are non-negative integers and the weight of the MST does not exceed 2⁵².
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.

Author:

Robert Sedgewick, Kevin Wayne

Constructor Summary

Constructors
Constructor Description

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

Method Summary

All Methods Static Methods Instance Methods Concrete Methods
Modifier and Type	Method	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).

Methods inherited from class java.lang.Object
clone, equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Constructor Detail
  - KruskalMST
```
public KruskalMST(EdgeWeightedGraph G)
```
    Compute a minimum spanning tree (or forest) of an edge-weighted graph.
    
    Parameters:
    
    G - the edge-weighted graph
- Method Detail
  - edges
```
public Iterable<Edge> edges()
```
    Returns the edges in a minimum spanning tree (or forest).
    
    Returns:
    
    the edges in a minimum spanning tree (or forest) as an iterable of edges
  - weight
```
public double weight()
```
    Returns the sum of the edge weights in a minimum spanning tree (or forest).
    
    Returns:
    
    the sum of the edge weights in a minimum spanning tree (or forest)
  - main
```
public static void main(String[] args)
```
    Unit tests the KruskalMST data type.
    
    Parameters:
    
    args - the command-line arguments