anowell

anowell / Dijkstra / 0.1.0

README.md
Dijkstra's  Path Planning Algorithm based on /kenny/Dijkstra but using input that specifies absolute edge distances rather than computing euclidian distance.

Input:
  • Nested Map of directed edges with distance, e.g., { "a": { "b": 3 }} implies the edge from "a" to "b" has a distance of 3
  • Start vertex
  • Goal vertex