Algorithm implements both bidirectional and unidirectional versions of Dijkstra's algorithm to find the shorthest path between the source node and the sink node. Bidirectional is empirically proven to be quite efficient.
-
Notifications
You must be signed in to change notification settings - Fork 0
onurbabat/Dijkstra_Algorithm_Implementation
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Algorithm implements both bidirectional and unidirectional versions of Dijkstra's algorithm
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published