tpl_fibonacci_heap.H File Reference

Fibonacci Heap implementation. More...

#include <ahUtils.H>
#include <ah-errors.H>
#include <ahFunctional.H>
#include <vector>
#include <algorithm>
#include <utility>

Include dependency graph for tpl_fibonacci_heap.H:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	Aleph::Fibonacci_Heap< T, Compare >
	Implementation of a Fibonacci Heap priority queue. More...
struct	Aleph::Fibonacci_Heap< T, Compare >::Node
	Represents a node in the Fibonacci Heap. More...

Namespaces
namespace	Aleph
	Main namespace for Aleph-w library functions.

Detailed Description

Fibonacci Heap implementation.

This file provides Fibonacci_Heap, a priority queue data structure with excellent amortized time complexity for decrease-key operations, making it ideal for algorithms like Dijkstra and Prim.

Author

Leandro Rabindranath León

Definition in file tpl_fibonacci_heap.H.