Initialization
Please enter the number of vertices that your graph has.
Draw Your Graph
Please fill in the information below to add edges to your graph. After you are done adding edges, click "Find MST".
A | B | C | D | |
A | NaN | NaN | NaN | NaN |
B | NaN | NaN | NaN | NaN |
C | NaN | NaN | NaN | NaN |
D | NaN | NaN | NaN | NaN |
Minimum Spanning Tree found
Please add the following edges to your graph and record its weight. The edges have been given in the order that you would find if you were to do Prim's Algorithm starting on vertex A.
Minimum Spanning Tree:
Weight of Spanning Tree: