Recommendation

Has Potential

Link

http://students.ceid.upatras.gr/~papagel/project/kruskal.htm

Delivery Method

Java Applet

License

Unavailable

Language

English

Author

Papagelis Athanasios

Institution

University of Patras

Project

UPatras Collection

RelationshipToProject

PartOfCollection

Works

Yes

Description

The web page provides a brief explanation of Kruskal's algorithm followed by an embedded visualization (applet) that demonstrates the algorithm. The visualization comprises two panes placed side by side. The left pane displays the original weighted undirected graph. As the algorithm executes, edges added to the MST and the nodes that these edges connect are highlighted in this graph. The graph in the right pane displays the current state of the partially constructed MST. When the algorithm terminates the right pane contains that completed MST. The visualization allows the user to step through the algorithm or view the completed solution. Several good example graphs are provided.

Evaluation

This visualization does a reasonable job at explaining the Kruskal's algorithm using several good examples. The color scheme chosen is effective. However, the visualization could improve on certain areas. While stepping through the algorithm, the visualization cycles back to the first step without providing any indication that the algorithm has terminated, which could confuse the uninitiated. Supporting explanation text within the visualization that explains what happens at each step could significantly enhance the visualization. The brief explanation at the beginning of the webpage uses non-standard terminology. For example, the minimum spanning tree is called the minimum genetic tree.

ActivityLevel

GoodFor

Lecture Aid

Screenshots

Videos

References

HowToUse

First Visited

2008-04-06

Last Visited

2008-04-06

Last Updated

1997-10-13

Topic

MinimumCostSpanningTree

Community

Edit

You may edit this entry if you have an account.