Package com.kuka.graph.util

This package contains common helper classes for working with graphs.

See:
Description

Interface Summary

PriorityQueue<E>	This priority queue interface is tailored for graph search algorithms.
PriorityQueue.Handle<T>	Handle to elements in a priority queue for efficient access.

Class Summary

ArraySetUnenforced<T>	Helper for efficiently representing small sets whose elements are known to be unique by construction, implying we don't need to enforce the uniqueness property in the data structure itself.
FibonacciHeap<K extends Comparable<K>,T>	This Fibonacci heap is a special implementation of a priority queue tailored for graph search algorithms.
FibonacciHeap.Handle<C,V>	Handle to elements in the heap for efficient access.
PairingHeap<E>	Implements a pairing heap.

Package com.kuka.graph.util Description

This package contains common helper classes for working with graphs.