Register
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
14.3k views
5 votes
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

User Drux
by
5.8k points

1 Answer

6 votes
I think the answer is B
User Pavan K
by
5.2k points
Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

6.0m questions

7.9m answers

Other Questions

A new information system is not considered in production until conversion is complete
a. STOP: What is a technology habit you practice today that you now realize will not help you to be successful? Explain why it’s important to STOP doing this right now.
Which theory uses game playing to understand the development of self?
Why might the government censor what its citizens see on the internet?
Flash drives cds external disks are all examples of storage (memory) devices
Link Copied!