This project was made for university classes. It includes Prim algorithm, Kruskal algorithm, Dijkstra's algorithm, Bellman–Ford algorithm, as well as strucrtes implementations (matrix and list graphs representations) to test them on. Project was written on linux (WLS Ubntu version 20.04).
- Project version: 1.1
Project was created using STL class, including:
- priority queues
- pairs
- vectors
To run this project, download it locally and execute it. Additonaly you can run this project using Makefile comments, Makefile includes valgrim commends like.
$ valgrind ./main
$ valgrindleak ./main