Register

shortest path adaptive routing

1,175 views

1 Answer

2 votes
2 votes
39). Answer is B, as the shortest path from D to B is D-->C-->B, with a minimum distance of 4 .

Hence the entry for NN will be C.

40).The entry for the OD will be 4.
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
Parshu gate asked Nov 28, 2017
760 views
Open Shortest Path First
User Avatar
0 votes
0 votes
0 answers
4
Malusi asked Jan 12
123 views
Consider a weighted undirected graph with positive edge weights and let (u, v) be an [2] edge in the graph. It is known that the shortest path from source vertex r to u has weight 53 and shortest path from r to v has weight 65. Which statement is always true?
Consider a weighted undirected graph with positive edge weights and let (u, v) be an edge in the graph. It is known that the shortest path from source vertex r to u hasw...
User Avatar
Link Copied!