https://github.com/mfurmanczyk/dijkstra
Implementation of Dijkstra Shortest Path algorithm with C++ and SFML.
https://github.com/mfurmanczyk/dijkstra
algorithms-and-data-structures cpp dijkstra-algorithm dijkstra-shortest-path
Last synced: 6 months ago
JSON representation
Implementation of Dijkstra Shortest Path algorithm with C++ and SFML.
- Host: GitHub
- URL: https://github.com/mfurmanczyk/dijkstra
- Owner: MFurmanczyk
- License: mit
- Created: 2024-05-07T21:28:09.000Z (about 2 years ago)
- Default Branch: master
- Last Pushed: 2024-05-27T19:40:12.000Z (about 2 years ago)
- Last Synced: 2024-12-30T03:18:45.056Z (over 1 year ago)
- Topics: algorithms-and-data-structures, cpp, dijkstra-algorithm, dijkstra-shortest-path
- Language: C++
- Homepage:
- Size: 53.7 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Dijsktra's algorithm
Implementation of Dijkstra's SP algorithm.
## Data structures and algorithms
- K-d tree - finds nearest vertex in a graph for start point and end point.
- Dijkstra's algorithm - finds shortest path in graph.
- Priority indexed queue - used in egde relaxation.
- Directed graph with weighted edges.
## Libraries
One of the goals of the project was to use the standard library in as many cases as possible. Visual side of this application is coded with [SFML](https://www.sfml-dev.org/).
## Controlls
| Action | Button |
| ------- | --- |
| Set start point | **LMB** |
| Set end point | **RMB** |
| Quit | **Esc** |
| Reset | **R** |
In order to find path user needs to:
1. Set start point.
2. Set end point.
3. If user wants to find another path Reset action is required.
## Screenshots
## Literature
Literature and sites I used while coding this application:
- [Algorithms, 4th edition](https://algs4.cs.princeton.edu/home/) by Robert Sedgewick and Kevin Wayne
- [C++ documentation](https://en.cppreference.com/w/)