'Union find data structure' presentation slideshows

Design and Analysis of Algorithms

528 views • 50 slides

Dynamic graph connectivity

Dynamic graph connectivity. Holm, Lichtenberg, Thorup (98) (based on Henzinger & King (95)). connected(v,w). connected( v , w ). connected( v , w ). insert( v , w ). insert( v , w ). delete( v , w ). delete( v , w ). delete( v , w ). delete( v , w ). Observations.

499 views • 46 slides

Union-Find: A Data Structure for Disjoint Set Operations

Union-Find: A Data Structure for Disjoint Set Operations. The Union-Find Data Structure. Purpose: Great for disjoint sets Operations:. Q) Under what scenarios would one need these operations?. A Motivating Application for Union-Find Data Structures.

781 views • 45 slides