Register

djikstra algo

255 views

1 Answer

Best answer
7 votes
7 votes

Answer : Calculate the routing table

Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, like this .And it is very useful when it comes to create a Routing Table to find the shortest path between Routes on the way.

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
2
Lokesh Arya asked Jul 4, 2018
174 views
Routings algo
what is the diffrence between protocols and Algorithms or both are same or not???
what is the diffrence between protocols and Algorithms or both are same or not???
User Avatar
0 votes
0 votes
2 answers
3
radha gogia asked Apr 10, 2018
726 views
What would be the message sent by the sender in RSA Algo ?
RSA public key cryptography used with public key pair (e,n) is given as (5 ,35) and the primitive key pair (d,n) as (29,35) . If receiver receives message as 22 , what would be the message sent by the sender : 1) 22 2) 29 3) 35 4) 31
RSA public key cryptography used with public key pair (e,n) is given as (5 ,35) and the primitive key pair (d,n) as (29,35) .If receiver receives message as 22 , what wou...
User Avatar
2 votes
2 votes
0 answers
4
A_i_$_h asked Sep 22, 2017
1,023 views
back off algo
Assume X and Y are the only two stations on ethernet.Each has a steady queue of frames to send.Both X and Y attempt to tranmit a frame,they wait to get the control of the channel using binary exponential algo.The prob that both were successfully allowed to send the frame on 5th round(assuming everytime both X and Y will collide in back off race till 4th round)
Assume X and Y are the only two stations on ethernet.Each has a steady queue of frames to send.Both X and Y attempt to tranmit a frame,they wait to get the control of the...
User Avatar
Link Copied!