BeginToLearn
asked on
link
hi all,
For example when i need to learn about shortest path algorithm, i go to this website
http://optlab-server.sce.carleton.ca/POAnimations2007/DijkstrasAlgo.html
So i can understand the concept easily from that guide.
I am looking similar website like that ( or easy to understand) for distance vector routing( bellman-ford and ford-fulkerson). Please help.
PS: i spent like 2 hrs to search , but fail. Thanks.
For example when i need to learn about shortest path algorithm, i go to this website
http://optlab-server.sce.carleton.ca/POAnimations2007/DijkstrasAlgo.html
So i can understand the concept easily from that guide.
I am looking similar website like that ( or easy to understand) for distance vector routing( bellman-ford and ford-fulkerson). Please help.
PS: i spent like 2 hrs to search , but fail. Thanks.
ASKER CERTIFIED SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
if you do a search in web you will get many links similar to it.
ASKER
oh i understand shorest path algorithm . I am stuck with the Distance Vector Routing
SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
OK.
Here is another link for Distance Vector Routing :
http://www.cs.umd.edu/~shankar/417-F01/Slides/chapter4a-aus/sld015.htm
Here is another link for Distance Vector Routing :
http://www.cs.umd.edu/~shankar/417-F01/Slides/chapter4a-aus/sld015.htm
ASKER
From here,
http://www.cs.umd.edu/~shankar/417-F01/Slides/chapter4a-aus/sld016.htm
could you please explain:
+ what is w?
+ the "loop" in red on how it iterate until we get 14. ( i choose the second one more general so i can understand better).
Thanks a lot.
http://www.cs.umd.edu/~shankar/417-F01/Slides/chapter4a-aus/sld016.htm
could you please explain:
+ what is w?
+ the "loop" in red on how it iterate until we get 14. ( i choose the second one more general so i can understand better).
Thanks a lot.