Computer Science, asked by mansijadhav559, 2 months ago

-2.Assume the shortest path in a graph from node A to node H is A→B→H.Also assume that the shortest path from node H to node N is H→G→N.What is the shortest path from node A to node N?algorithm or to the link-state routing algorithm? Explain.​

Answers

Answered by skpillai636
6

Answer:

Explanation:

Assume the shortest path in a graph from node A to node H is A→B→H.Also assume that the shortest path from node H to node N is H→G→N.What is the shortest path from node A to node N?algorithm or to the link-state routing algorithm? Explain.​

Previous Question
Next Question
Similar questions
Psychology, 1 month ago
morning jokes be like... gummoning♥♥ ​...
Social Sciences, 1 month ago
who is the present queen of england​...
Math, 1 month ago
In the given figure O is the centre of the circle and OD BC. Then prove that ∠BAC = ∠COD...
Physics, 2 months ago
please give me solution of this question​...
English, 2 months ago
please answer the question from treasure trove icse class 10 ch 7 a little match girl....please exam tomorrow.. please​...
Sociology, 8 months ago
do you agree with what he wrote to his son's teacher give reasons​...
History, 8 months ago
When and by whom was the regulating Act passed ? Examine the administrative changes brought about by this Act.
Math, 8 months ago
check weather g(x) is a factor of p(x) by dividing polynomial p(x) by g(x), where p(x)=x^5-4x³+x²+3x+1, g(x)=x³-3x+1​...