cancel
Showing results for 
Search instead for 
Did you mean: 
cancel
1983
Views
0
Helpful
1
Replies

Dijkstra algorithm

ashookoul
Level 1
Level 1

Hi

can u please tell me the formula for calculating shortest path using Dijkstra algorithm.

regards

ashoo

1 Reply 1

ankurbhasin
Level 9
Level 9

Hi Ashoo,

It is calculated as follows 100000000/bandwidth in bps.

Now you need to add the resulted values from all outgoing links till the destination and this will result in the total cost to reach the destination and the path with the least value is the best and shortest path.

The algorithm places each router at the root of a tree and calculates the shortest path to each destination based on the cumulative cost required to reach that destination

Have a look at this link

http://www.cisco.com/warp/customer/104/1.html#t5

HTH

Ankur

Review Cisco Networking products for a $25 gift card