Uses of Class
org.jgrapht.traverse.ClosestFirstIterator.QueueEntry
-
Packages that use ClosestFirstIterator.QueueEntry Package Description org.jgrapht.traverse Graph traversal means. -
-
Uses of ClosestFirstIterator.QueueEntry in org.jgrapht.traverse
Fields in org.jgrapht.traverse with type parameters of type ClosestFirstIterator.QueueEntry Modifier and Type Field Description private FibonacciHeap<ClosestFirstIterator.QueueEntry<V,E>>
ClosestFirstIterator. heap
Priority queue of fringe vertices.Methods in org.jgrapht.traverse that return types with arguments of type ClosestFirstIterator.QueueEntry Modifier and Type Method Description private FibonacciHeapNode<ClosestFirstIterator.QueueEntry<V,E>>
ClosestFirstIterator. createSeenData(V vertex, E edge)
The first time we see a vertex, make up a new heap node for it.
-