Question 1 out of 3

    Which algorithm is used for finding the shortest path in a graph?

    Dijkstra's Algorithm

    Dijkstra's Algorithm is specifically designed to find the shortest path from a source node to all other nodes in a graph.