New RBI Grade B 2025 Notification will come Soon! Enroll Here

    Question

    Which famous algorithm follows a greedy approach for

    solving the minimum spanning tree problem in a graph?
    A Kruskal's algorithm Correct Answer Incorrect Answer
    B Dijkstra's algorithm Correct Answer Incorrect Answer
    C Bellman-Ford algorithm Correct Answer Incorrect Answer
    D Depth-First Search (DFS) Correct Answer Incorrect Answer
    E None of the mentioned Correct Answer Incorrect Answer

    Solution

    The correct answer is A

    Practice Next