A simple script to read in nodes/edges and calculate the shortest route using Dijkstra's Algorithm.
Written for python3.7, untested in other versions but not using anything overly new.
./run.sh graph.dat 876500321 1524235806
2709
python router.py --data=graph.dat --start=876500321 --end=1524235806
2709