What is routing? explain shortest path routing with example?
Answers
Answered by
0
The k shortest path routingalgorithm is an extension algorithm of the shortest path routing algorithm in a given network. It is sometimes crucial to have more than one path between two nodes in a given network. In the event there are additional constraints, other paths different from the shortest path can be computed.
I hope this is help full to u..
I hope this is help full to u..
Similar questions