![]() ![]() ![]() c( i, j): Link cost from node i to node j.The Dijkstra's algorithm is an iterative, and it has the property that after k th iteration of the algorithm, the least cost paths are well known for k destination nodes.The Link state routing algorithm is also known as Dijkstra's algorithm which is used to find the shortest path from one node to every other node in the network.Final state: Each node knows the entire graph.Įach node uses Dijkstra's algorithm on the graph to calculate the optimal routes to all nodes. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |