Minimum Spanning Tree.
Important: Kruskal's and Prim's find a
Minimum Spanning Tree.
Graph Controls
One edge per line: Node1 Node2 Weight
Example: A B 7
Ready.
How manual mode works
1. Build or load a graph.
2. Enter the MST edges in the answer box.
3. Click Check Answer.
4. If your tree has the same minimum cost, it is accepted.
Graph View
Mode: none
White = graph edgeGreen = MST edge chosenBlue = current edgeRed = rejected edgeOrange node = graph node
Quick add: Click one node, then click another node to add an
edge. The app will ask for the weight.
Current Output
No result yet.
Teaching Mode
Explanation
Prepare a graph first, then choose an algorithm and step through it.