Files | |
file | bin_heap.h |
Binary Heap implementation. | |
file | fib_heap.h |
Fibonacci Heap implementation. | |
file | linear_heap.h |
Binary Heap implementation. | |
file | radix_heap.h |
Radix Heap implementation. | |
file | radix_sort.h |
Radix sort. | |
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 | LinearHeap |
A Linear Heap implementation. 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 | |
template<typename Iterator, typename Functor> | |
void | lemon::radixSort (Iterator first, Iterator last, Functor functor) |
Sorts the stl compatible range into ascending order. | |
template<typename Iterator, typename Functor> | |
void | lemon::counterSort (Iterator first, Iterator last, Functor functor) |
Sorts stable the stl compatible range into ascending order. |
|
The
This implemented radix sort is a special quick sort which pivot value is choosen to partite the items on the next bit. This way, let be
|
|
The
This implemented counter sort use a radix forward sort on the bytes of the integer. The algorithm can sort the items on a given byte. First time it counts how many times occurs a byte value in the container. By the occurence number it is possible to copy the container in the right order in This sorting algorithm is stable so the order of two equal element stay in the same order.
|