Which of the following is a characteristic of Dijkstra's algorithm?

₹0.0

Question: Which of the following is a characteristic of Dijkstra\'s algorithm?

Options:

Correct Answer: It can be used for both directed and undirected graphs.

Solution:

Dijkstra\'s algorithm can be used for both directed and undirected graphs, provided that all edge weights are non-negative.

Which of the following is a characteristic of Dijkstra's algorithm?

Which of the following is a characteristic of Dijkstra's algorithm?

Step 1: Understand that Dijkstra's algorithm is a method used to find the shortest path in a graph.
Step 2: Know that a graph can be directed (where edges have a direction) or undirected (where edges do not have a direction).
Step 3: Remember that Dijkstra's algorithm works only if all the weights (or costs) of the edges in the graph are non-negative (meaning they cannot be negative).
Step 4: Conclude that Dijkstra's algorithm can be applied to both types of graphs (directed and undirected) as long as the edge weights are non-negative.

No concepts available.