Which of the following statements is true about Dijkstra's algorithm?

Which of the following statements is true about Dijkstra's algorithm?

Step 1: Understand what Dijkstra's algorithm is. It is a method used to find the shortest path from one point to another in a graph.
Step 2: Know that a graph is made up of nodes (points) and edges (connections between points).
Step 3: Recognize that Dijkstra's algorithm works best when the weights (values) on the edges are non-negative, meaning they cannot be less than zero.
Step 4: Remember that if there are negative weights in the graph, Dijkstra's algorithm may not give the correct shortest path.
Step 5: Conclude that the statement 'Dijkstra's algorithm always finds the shortest path in graphs with non-negative weights' is true.

No concepts available.