Question

    Which algorithm solves the shortest path problem in a weighted graph?

    A Depth-first search Correct Answer Incorrect Answer
    B Breadth-first search Correct Answer Incorrect Answer
    C Dijkstra's algorithm Correct Answer Incorrect Answer
    D Bellman-Ford algorithm Correct Answer Incorrect Answer

    Solution

    Dijkstra's algorithm solves the shortest path problem in a weighted graph.

    Practice Next

    Relevant for Exams: