mirror/dijkstra-shortest-path-algorithm: 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. - dijkstra-shortest-path-algorithm - git.dotya.ml

mirror/dijkstra-shortest-path-algorithm

mirror of https://gitlab.com/somespace/dijkstra-shortest-path-algorithm.git synced 2026-08-04 09:22:57 +02:00

T

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:

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