Routing Table for packets transmission in networking. It is using Dijkstra's algorithm to figure out the shortest path between two sources in order to decrease the delay time.There are two test files given, one with sources represented with numerical value and the other one with characters based value. This algorithm can also be used to find out the shortest path between 2 locations on Earth given the file with distances to intermediate locations.
-
Notifications
You must be signed in to change notification settings - Fork 0
It creates routing tables for packets transmission used in networking. It is using Dijkstra's algorithm to figure out the shortest path between two sources in order to decrease the delay time.
vstadn/Dijkstras_Algorithm
About
It creates routing tables for packets transmission used in networking. It is using Dijkstra's algorithm to figure out the shortest path between two sources in order to decrease the delay time.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published