Version 5.0 The LEDA User Manual

Chapter 18
Implementations
18.1 List of data structures
This section lists the data structures for dictionaries, dictionary arrays, priority queues,
and geometric data types currently contained in LEDA. For each of the data structures
its name and type, the list of LEDA data types it can implement, and a literature
reference are given. Before using a data structures xyz the corresponding header file
has to be included (cf. section 2.2 for an example).
18.1.1 Dictionaries
ab tree a-b tree dictionary, d array, sortseq [12]
avl tree AVL tree dictionary, d array [5]
bb tree BB[α] tree dictionary, d array, sortseq [13]
ch hashing hashing with chaining h array [58]
dp hashing dyn. perf. hashing h array [24], [88]
pers tree persistent tree p dictionary [25]
rb tree red-black tree dictionary, d array, sortseq [42]
rs tree rand. search tree dictionary, d array, sortseq [2]
skiplist skip lists dictionary, d array, sortseq [77]
18.1.2 Priority Queues
f heap Fibonnacci heap priority queue [36]
p heap pairing heap priority queue [84]
k heap k-nary heap priority queue [58]
m heap monotonic heap priority queue [58]
eb tree Emde-Boas tree priority queue [29], [88]
18.1.3 Geometry
range tree range tree d2 dictionary, point set [90], [57]
seg tree segment tree seg set [8], [27]
ps tree priority search tree — [60]
iv tree interval tree interval set [59], [27]
delaunay tree delaunay tree point set [22]
707