FibonacciHeap

Fibonacci Heap Container.

struct FibonacciHeap (

V

) {

alias N = Node!V;

protected @safe pure nothrow

N* insert(V value);

void merge(FibonacciHeap other);

bool empty();

inout(V) minimum();

V removeMinimum();

void decreaseKey(N* n, V value);

N* find(V value);

}

Destructor

~this ~this(): Undocumented in source.

Members

Aliases

N alias N = Node!V: Undocumented in source.

Functions

decreaseKey void decreaseKey(N* n, V value): Undocumented in source. Be warned that the author may not have intended to support it.
empty bool empty(): Undocumented in source. Be warned that the author may not have intended to support it.
find N* find(V value): Undocumented in source. Be warned that the author may not have intended to support it.
insert N* insert(V value): Undocumented in source. Be warned that the author may not have intended to support it.
merge void merge(FibonacciHeap other): Undocumented in source. Be warned that the author may not have intended to support it.
minimum inout(V) minimum(): Undocumented in source. Be warned that the author may not have intended to support it.
removeMinimum V removeMinimum(): Undocumented in source. Be warned that the author may not have intended to support it.

Variables

root N* root;: Undocumented in source.

See Also

http://www.codeproject.com/Articles/42561/Dijkstra-s-Algorithm-for-Network-Optimization-Usin

http://www.sanfoundry.com/cpp-program-implement-fibonacci-heap/

Meta

Source

See Implementation

nxt fibonacci_heap functions

structs