Trakla - Prim's Minimum Cost Spanning Tree Algorithm
| Collection: | AlgoViz |
| Source: | http://algoviz.org/node/1226 |
| Format: | Java Application |
Recommendation: Has Potential.
Description: User clicks on nodes of the graph in order that they are processed.
Evaluation: This is a great idea to have users show proficiency in the algorithm by processing the graph. But the implementation does not quite work out. The big problem is that the edge distances are not shown on the graph. They are shown in an adjacency list, but it is extremely difficult for users to integrate that information to pick the next vertex. The graph layouts are poor, and it would not be a simple thing to label the edges with their distances.
| Creator(s): | Ari Korhonen, Lauri Malmi, Kimmo St'lnacke, Ville Karavirta |
| Publisher: | Helsinki University of Technology |
| Subject: | Graph Algorithms, Minimum spanning trees |
| Relation: | Trakla2 |
| Language: | english |
| Rights: | Licensed under GPL |
Attachments:

