Typically, a search operation in a hashing implementation takes time linear in the maximal size of any subset whose elements are assigned the same hash value. We demonstrate the use of Hash and a data type based on hashing by extending the example from the previous section. This provides a mechanism for choosing implementations of data types in pre-compiled algorithms. LEDA offers several implementations for each of the data types. For instance, skip lists, randomized search trees, and red-black trees for dictionary arrays.
Users can also provide their own implementation.
A detailed description of the mechanism for parameterized data types and implementation parameters used in LEDA will be published soon. Copyright 1998-2001, Algorithmic Solutions Software GmbH . All rights reserved.