ЁЯУв Too many exams? DonтАЩt know which one suits you best? Book Your Free Expert ЁЯСЙ call Now!

    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

    Solution

    Kruskal's algorithm

    Practice Next
    More IT Networking Questions

    Relevant for Exams:

    ask-question