This is a simple implementaion of Kruskal's algorithm to find the minimum spanning tree. There is animation to show how the algorithm progresses by showing all the paths it takes to find the tree. React was used to implement visualization.

There are two sample networks that show the implementation.

In the project directory, you can run:

Runs the app in the development mode.
Open http://localhost:3000 to view it in the browser.

The page will reload if you make edits.
You will also see any lint errors in the console.