Build your intuition. Click the correct answer from the options.
What algorithm is commonly used to find the shortest path between two nodes in a graph?
Click the option that best answers the question.
- Breadth-First Search (BFS)
- Depth-First Search (DFS)
- Dijkstra's algorithm
- A* algorithm