Minimum Spanning Tree Generator Go to the GitHub Repo

This is a test-data generator for algorithms which determine the MST of weighted, undirected graphs.

Just choose a number of nodes and click "Generate" at the bottom. Then, click on the output to highlight it, and press ctrl+c to copy it.

The MST output will appear in a separate box next-to or below the main output box. It lists the arcs/edges of the MST in the format "[(vertex1 vertex2 weight)]".

Things to note about the output:

The order the arcs are listed in does NOT matter. For example, [(A B 2), (B C 1), (C D 4)] is equivalent to [(C D 4), (A B 2), (B C 1)]
The order of vertices in an arc also doesn't matter. For example, (A D 3) is equivalent to (D A 3)

Number of Nodes/Vertices (between 1 and 100):

Advanced