📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!


    âš¡ Month End Offer - Flat 52% Off On All Courses! Enroll Now âš¡
    00:00:00 AM Left

    Question

    Tarjan’s Algorithm

    finds:
    A Minimum spanning tree Correct Answer Incorrect Answer
    B Strongly connected components Correct Answer Incorrect Answer
    C Max flow Correct Answer Incorrect Answer
    D Shortest path Correct Answer Incorrect Answer
    E Bipartite matching Correct Answer Incorrect Answer

    Solution

    Tarjan’s algorithm finds SCCs in O(V+E).

    Practice Next
    More Data Structure Questions
    ask-question