Computer Science, asked by mansijadhav559, 7 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

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

Math, 3 months ago

If y+1 is factor of 2y cube + 9y square + y + k, then k=? A) 10 B) 11 C) 12 D) -12...

Chemistry, 3 months ago

How many things in your house are made up of minerals??? Pls don’t use chrome...

Physics, 3 months ago

What do u mean by electromagnetic induction...

Physics, 7 months ago

please give me solution of this question...

English, 7 months ago

please answer the question from treasure trove icse class 10 ch 7 a little match girl....please exam tomorrow.. please...

Sociology, 1 year ago

do you agree with what he wrote to his son's teacher give reasons...

History, 1 year ago

When and by whom was the regulating Act passed ? Examine the administrative changes brought about by this Act.

Math, 1 year 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...

-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

-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.