Skip to content

EdgyEdgemond/dijkstra_router

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

11 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Dijkstra Router

A simple script to read in nodes/edges and calculate the shortest route using Dijkstra's Algorithm.

Assumptions

Written for python3.7, untested in other versions but not using anything overly new.

Usage

	./run.sh graph.dat 876500321 1524235806
	2709
	python router.py --data=graph.dat --start=876500321 --end=1524235806
	2709

About

Walk path router using Dijkstra's Algorithm

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published