PoliMI Operational Research course challenge. Find the shortest path for a pedibus
-
Updated
Sep 4, 2017 - Python
PoliMI Operational Research course challenge. Find the shortest path for a pedibus
dijkstra is a native Python implementation of famous Dijkstra's shortest path algorithm. The implemented algorithm can be used to analyze reasonably large networks. The primary goal in design is the clarity of the program code. Thus, program code tends to be more educational than effective.
Add a description, image, and links to the shortest topic page so that developers can more easily learn about it.
To associate your repository with the shortest topic, visit your repo's landing page and select "manage topics."