Collaboration diagram for Auxiliary Data Structures:
![]() |
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 . |
|
This method calls push( Definition at line 258 of file fib_heap.h. |
|
Adds
Definition at line 270 of file fib_heap.h. |
|
This method deletes the item with minimum priority relative to
Definition at line 302 of file fib_heap.h. |
|
This method deletes Definition at line 337 of file fib_heap.h. |
|
This method decreases the priority of
Definition at line 354 of file fib_heap.h. |