A generalized version of Dijkstra's algorithm to find optimal path using metrics other than shortest path. It allows to find optimal paths using the metrics: Hop Count, Shortest Path and Widest Path (Bandwith) and builds the foundation to use other metrics as well. The methodology of the implementation is based on the routing algebra theory.
-
Notifications
You must be signed in to change notification settings - Fork 0
konsteva/Dijkstras-Generalization
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A generalized version of Dijkstra's algorithm to find optimal path using metrics other than shortest path
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published