An open API service indexing awesome lists of open source software.

https://github.com/iinjyi/kruskal-mst

3rd year Algorithms analysis and design project: Implementing Kruskal's algorithm and insertion sort to generate MST in C++
https://github.com/iinjyi/kruskal-mst

algorithms graph insertion-sort kruskal-algorithm minimum-spanning-tree

Last synced: 2 months ago
JSON representation

3rd year Algorithms analysis and design project: Implementing Kruskal's algorithm and insertion sort to generate MST in C++

Awesome Lists containing this project

README

        

# 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.
+ ![image](https://user-images.githubusercontent.com/90464702/208552819-b888cad5-19bc-4f9f-8b7a-6282e3ad8e20.png)

- ### 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:

https://user-images.githubusercontent.com/90464702/208555675-6d8c4734-f52d-4daf-8385-7203b1bead32.mp4

https://user-images.githubusercontent.com/90464702/208555719-487bf5c0-dfa8-47df-a944-d78b156f8898.mp4