mirror/dijkstra-shortest-path-algorithm
1
0
Fork 0
mirror of https://gitlab.com/somespace/dijkstra-shortest-path-algorithm.git synced 2025-01-31 11:31:40 +01:00
Code Issues Releases Activity
This program implements Dijsktra's SP algorithm, which finds the shortest path between source and destination node. The algorithm considers also color of the nodes as choosing criteria.
4 Commits 1 Branch 0 Tags 42 KiB
C++ 97.9%
CMake 2.1%
master
Go to file
Martin Schneider 34f5a16d42 Update README.md
2020-10-04 20:02:37 +00:00
CMakeLists.txt Initial commit 2020-10-03 15:36:57 +02:00
CMakeLists.txt.user Initial commit 2020-10-03 15:36:57 +02:00
graph.cpp Initial commit 2020-10-03 15:36:57 +02:00
graph.h Initial commit 2020-10-03 15:36:57 +02:00
main.cpp Initial commit 2020-10-03 15:36:57 +02:00
README.md Update README.md 2020-10-04 20:02:37 +00:00
shortest_path.cpp Initial commit 2020-10-03 15:36:57 +02:00
shortest_path.h Initial commit 2020-10-03 15:36:57 +02:00

README.md

Dijkstra Shortest Path algorithm (own implementation):

Reference: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm

Ways to open the project:

  1. Open the file named CMakeLists.txt in QT Creator IDE.
  2. Unzip archive and navigate to the project folder in terminal, then run this command: cmake CMakeLists.txt && make