A visual representation of Dijkstra's Algorithm using Libgdx.
The project has the purpose of helping to comprehend the functionality of Dijkstra's Algorithm through a visual representation of itself.
Any contributions to the project are allowed and another purpose usage too. So feel free to do whatever you want with it ;).
| Keys | Commands | Obs |
|---|---|---|
| Left Click | Draw spot | If the start position is not setted yet it will be the first spot drawed, after that it will be setted the end position, once start and end position are setted the barriers will be drawed. |
| Right Click | Erase spot | |
| Space | Start Algorithm | The start and end position must be setted to start the algorithm. |
| R | Restart | |
| Esc | Quit |
$ git clone https://github.com/JuanCarlosCardona/DijkstraAlgorithmVisualization.git
$ cd DijkstraAlgorithmVisualization
$ ./gradlew build
$ ./gradlew run