2: Minimum Spanning Tree Problem
A spanning tree connects
all of the nodes in a graph and has no cycles.
Below is a graph in which the arcs are labeled with distances between
the nodes that they are
Press the Start button on the example below to learn how to find the
minimum spanning tree of a graph.
This animation was made using Alligator Flash Designer 7.
More information about this program is available at
You can view the source code for this animation using the trial verson
of Alligator Flash Designer 7 and