Ask Question

Using Dijkstra's algorithm to find the shortest path from node 1 to all other vertices, which node is the last one to be declared known?

A)

node 4

B)

node 5

C)

node 6

D)

node 7

+4
Answers (1)
  1. 5 August, 04:51
    0
    I think the answer is B
Know the Answer?
Not Sure About the Answer?
Find an answer to your question 👍 “Using Dijkstra's algorithm to find the shortest path from node 1 to all other vertices, which node is the last one to be declared known? A) ...” in 📗 Computers & Technology if the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Search for Other Answers