1.1.5 Set Data Structures

Problem Input | Problem Output 


INPUT                    OUTPUT

Input Description: A universe of objects U = \{ u_1,...,u_n\} , and a collection of subsets S_1,...,S_m , S_i \subset U .

Problem: Represent each subset so as to efficiently (1) test whether u_i \in S_j , (2) find the union or intersection of S_i and S_j , (3) insert or delete members of S_i .

Implementations

  • LEDA - A Library of Efficient Data Types and Algorithms (C++) (rating 5)
  • LINK -- Programming and Visualization Environment for Hypergraphs (C++) (rating 4)
  • Moret and Shapiro's Algorithms P to NP (Pascal) (rating 4)

    Related Problems

  • Generating Partitions
  • Generating Subsets
  • Graph Data Structures
  • Minimum Spanning Tree
  • Set Cover

    Go to the corresponding chapter in the book
    About the Book
    Send us Mail
    Go to Main Page

    This page last modified on Tue Jun 03, 1997 .