Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | Directories | File List | Namespace Members | Class Members | File Members | Related Pages

Auxiliary Data Structures
[Data Structures]

Collaboration diagram for Auxiliary Data Structures:


Detailed Description

This group describes the data structures implemented in LEMON in order to make it easier to implement combinatorial algorithms.


Files

file  bin_heap.h
 Binary Heap implementation.
file  fib_heap.h
 Fibonacci Heap implementation.
file  unionfind.h
 Union-Find data structures.

Modules

 Tools to Make It Easier to Make Graph Maps
 Tools to Make It Easier to Make Graph Maps.

Classes

class  BinHeap
 A Binary Heap implementation. More...
class  FibHeap
 Fibonacci Heap. More...
class  UnionFind
 A Union-Find data structure implementation. More...
class  UnionFindEnum
 A Union-Find data structure implementation which is able to enumerate the components. More...

Functions

void lemon::FibHeap::set (Item const item, PrioType const value)
 item gets to the heap with priority value independently if item was already there.
void lemon::FibHeap::push (Item const item, PrioType const value)
 Adds item to the heap with priority value.
void lemon::FibHeap::pop ()
 Deletes the item with minimum priority relative to Compare.
void lemon::FibHeap::erase (const Item &item)
 Deletes item from the heap.
void lemon::FibHeap::decrease (Item item, PrioType const value)
 Decreases the priority of item to value.


Function Documentation

void set Item const   item,
PrioType const   value
[inherited]
 

This method calls push(item, value) if item is not stored in the heap and it calls decrease(item, value) or increase(item, value) otherwise.

Definition at line 258 of file fib_heap.h.

void push Item const   item,
PrioType const   value
[inherited]
 

Adds item to the heap with priority value.

Precondition:
item must not be stored in the heap.

Definition at line 270 of file fib_heap.h.

void pop  )  [inherited]
 

This method deletes the item with minimum priority relative to Compare from the heap.

Precondition:
The heap must be non-empty.

Definition at line 302 of file fib_heap.h.

void erase const Item &  item  )  [inherited]
 

This method deletes item from the heap, if item was already stored in the heap. It is quite inefficient in Fibonacci heaps.

Definition at line 337 of file fib_heap.h.

void decrease Item  item,
PrioType const   value
[inherited]
 

This method decreases the priority of item to value.

Precondition:
item must be stored in the heap with priority at least value relative to Compare.

Definition at line 354 of file fib_heap.h.


Generated on Sat Mar 19 10:58:47 2005 for LEMON by  doxygen 1.4.1