When using Dijkstra's algorithm to find shortest path in a graph, which of the following

February 22, 2020 9:50 am

Choose Your Answer:

AIt can find shortest path within the same graph data structure

BEvery time a new node is visited, we choose the node with smallest known distance/cost(weight) to visit first

CShortest path always passes through least number of vertices

DThe graph needs to have a non-negative weight on every edge

Eduncle Best Answer
Option 1. TRUE : Dijkstra's algorithm always find shortest path with in the same graph data structure. It uses a greedy technique to identify shortest path.
Option 2 ...
Show more
Likes(0) Reply(0)

Head Office :

MPA 44, 2nd floor, Rangbari main Road Mahaveer Nagar II, Kota (Raj.) - 324005

Branch Office (Jaipur):

Shyam Tower, Plot No. F2, 6th Floor Amrapali Circle,
Vaishali Nagar, Jaipur, Rajasthan 302021

Mail: info@eduncle.com