A map visualizer allowing to make queries about the shortest path between two diferent locations in the map. Made using graph theory.
You can download the .exe file in the x64 build folder or you can clone this repository.
- Click on any street intersection, which will be the starting point for the path.
- Click on any different street intersection to select the destination and the shortest path will be drawn immediately.
- Click anywhere in the program to clear the map and start again.
- Click the button "Draw Paths" and some posible autobus paths will be painted on the map. Those paths are will cover the whole map as much as posible. every path will be painted with a delay of .5 seconds
