Kruskal's

Select the edge to be checked (it will turn blue).
Click again on the same edge to add it to the MST (it will turn brown).
Black edges are not visited yet.
Select carefully: any wrong selection resets the graph.
Click Reset to start over with the same graph.
Click New Graph to start over with a new graph.
Zoom or adjust the graph by dragging nodes as needed.

Edge Colors: Black = Not Visited, Blue = Edge being/has been checked, Brown = Edge added to MST.

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}

Debug Info
Selected edges:

Observations

Kruskal's