Path Compression: Tarjan's Analysis I [Advanced - Optional]

Loading...
From the course by Stanford University
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
402 ratings
Stanford University
402 ratings
Course 3 of 4 in the Specialization Algorithms

Meet the Instructors

  • Tim Roughgarden
    Tim Roughgarden
    Professor
    Computer Science