πŸ“’ Too many exams? Don’t know which one suits you best? Book Your Free Expert πŸ‘‰ call Now!


    Question

    Which algorithm is used for shortest path in

    graphs?
    A Merge Sort Correct Answer Incorrect Answer
    B BFS Correct Answer Incorrect Answer
    C Dijkstra Correct Answer Incorrect Answer
    D Kruskal Correct Answer Incorrect Answer
    E Prim Correct Answer Incorrect Answer

    Solution

    Dijkstra finds the shortest path in weighted graphs.

    Practice Next
    ask-question