Kruskal's Algorithm MST

Implementing Kruskal's algorithm along with insertion sort in C++ to generate Minimum spanning tree and calculate its cost.

• Important notes:

  • Release:
    • You MUST download and unzip the whole .zip file in the releases and place the .exe and .ttf files in the same directory in order for the executable to work properly.
  • Code review / edit:
    • You MUST compile it in release mode, as debug mode may cause issues.
    • 

• Instruction manual:

  • Add new vertex:
    • Click on left mouse in the position where you want to add a vertex.
  • Add new edge:
    • Click on right mouse on vertex one then click on right mouse on vertex two, then enter the edge weight in the command prompt associated with the app then press enter.
  • Start calculating:
    • Press space bar.

• Snapshots:

How.to.unzip.mp4

How.to.compile.and.run.mp4