Question 1

+3−0Multiple correct

Which of the following statements is true about Dijkstra's algorithm to find the shortest path?

Select all that apply.

A.
Dijkstra’s algorithm may fail for graphs with negative weights because it does not reconsider a node once it marks it as visited, even if there is a shorter path than the previous one.
B.
The shortest path between two vertices and in a graph always remains unaltered when all the edges of are incremented by an equal amount.
C.
The shortest path between two vertices and in a graph always remains unaltered when all the edges of are multiplied by a positive integer.
D.
To decide which node to visit next, Dijkstra's algorithm selects the unvisited node with the smallest known distance.

+3−0Multiple correct

Which of the following statements is true about Dijkstra's algorithm to find the shortest path?

Select all that apply.

A.
Dijkstra’s algorithm may fail for graphs with negative weights because it does not reconsider a node once it marks it as visited, even if there is a shorter path than the previous one.
B.
The shortest path between two vertices and in a graph always remains unaltered when all the edges of are incremented by an equal amount.
C.
The shortest path between two vertices and in a graph always remains unaltered when all the edges of are multiplied by a positive integer.
D.
To decide which node to visit next, Dijkstra's algorithm selects the unvisited node with the smallest known distance.

Report a problem