Namespace QuikGraph.Collections

Classes

BinaryHeap<TPriority, TValue>

Binary heap.

BinaryQueue<TVertex, TDistance>

Priority queue to sort vertices by distance priority (use BinaryHeap<TPriority, TValue>).

EdgeEdgeDictionary<TVertex, TEdge>

Stores association of vertices to edges.

EdgeList<TVertex, TEdge>

Stores a list of edges.

FibonacciHeap<TPriority, TValue>

Heap following Fibonacci rules.

FibonacciHeapCell<TPriority, TValue>

Represents a cell that stores a value with its priority.

FibonacciHeapLinkedList<TPriority, TValue>

Represents a list of FibonacciHeapCell<TPriority, TValue>.

FibonacciQueue<TVertex, TDistance>

Priority queue to sort vertices by distance priority (use FibonacciHeap<TPriority, TValue>).

ForestDisjointSet<T>

Disjoint-set implementation with path compression and union-by-rank optimizations.

Queue<T>

Represents a queue (First in, First out).

SoftHeap<TKey, TValue>

Soft heap, which aims to has a constant amortized time for creation of heap, inserting an element merging two heaps, deleting an element and finding the element with minimum key.

VertexEdgeDictionary<TVertex, TEdge>

Stores associations of vertices to their edges.

VertexList<TVertex>

Stores a list of vertices.

Interfaces

IDisjointSet<T>

A disjoint-set data structure.

IEdgeList<TVertex, TEdge>

Represents a cloneable list of edges.

IPriorityQueue<T>

Represents a queue with priority.

IQueue<T>

Represents a queue (First in, First out).

IVertexEdgeDictionary<TVertex, TEdge>

A cloneable dictionary of vertices associated to their edges.

Enums

HeapDirection

Specifies the order in which a Heap will Dequeue items.