Question

Which of the following conditions must be satisfied for Dijkstra's Algorithm to work correctly?

A The graph must be undirected only
B The graph must not contain negative weight edges
C The graph must be cyclic
D The graph must be a tree
E The graph must have equal edge weights
Practice Next

Relevant for Exams:

Hey! Ask a query