Disjoint-set data structure

Disjoint-set data structure

Jesse Russell Ronald Cohn

     

бумажная книга



ISBN: 978-5-5144-6484-5

High Quality Content by WIKIPEDIA articles! In computing, a disjoint-set data structure is a data structure that keeps track of a set of elements partitioned into a number of disjoint (nonoverlapping) subsets. A union-find algorithm is an algorithm that performs two useful operations on such a data structure: