# Kruskal's Algorithm

## MST Problem:

Given a connected graph G=(V,E) and a weight d:E->R+,
find a minimum spanning tree T.

## Kruskal's Algorithm

- Set i=1 and let E
_{0}={}
- Select an edge e
_{i} of minimum value
not in E_{i-1} such that
T_{i}=<E_{i-1} cup {e_{i}} >is acyclic
and define
E_{i}=E_{i-1} cup {e_{i}}.
If no such edge exists, Let T=<E_{i}>and stop.
- Replace i by i+1. Return to Step 2.

## JAVA applet demos of Kruskal's algorithm.

## Java Source Files:

## SEE ALSO

Last Modified:
Tue May 12 18:58:03 JST 1998

Mail to:
ikeda@is.tokushima-u.ac.jp