Kruskal's

Select the edge to be checked.
Click on the selected edge if it is to be added .
Select carefully as on any wrong selection the whole graph should be reset .
Click on Reset to start over with the same graph
Click on New Graph to start over with a new graph
Zoom or Adjust graph by dragging nodes according to your convenience

Question : Maximum spanning tree is the spanning tree with maximum length of tree. Apply the concept of Kruskal's to find Maximum spanning tree of graph below {Hint : Sort and check in decreasing order of edge weights and add it to spanning tree if it does not form a circle}

Not Visited
Edge added to MST
Edge being/has been checked

Observations

Kruskal's