This program implements Dijkstra's shortest path closest pair algorithm to find the optimal detour to circumvent road closures. It reads input from a file that represents a weighted and directed acylic graph.
-
Notifications
You must be signed in to change notification settings - Fork 0
chasejh/dijkstrasalgorithm
About
A program that reads a file representing a weighted, directed acyclic graph and finds the closest pair shortest path by implementing dijkstra's algorithm.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published