This is a simple sample of the Dijkstra algorithm implemented for Data Structures Discipline of PUCPR.
The goal of the program is to find the best path between two subway stations of the fictional city of Graphland. Take a look in the extra folder for a picture of this subway system.
A video explanation (in portuguese) is also available on YouTube:
For more information, you can also check this site that compares several path finding algorithms: https://qiao.github.io/PathFinding.js/visual/
The wikipedia page about Dijkstra algorithm: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm
And finally, this great tutorial about A* algorithm, available in several languages: https://www.youtube.com/watch?v=i0x5fj4PqP4
If you just want to download an executable .jar file and play around, just click here