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

Subclasses with type arguments of type ClosestFirstIterator.QueueEntry in org.jgrapht.traverse

Modifier and Type	Class	Description
class	ClosestFirstIterator<V,E>	A closest-first iterator for a directed or undirected graph.

Fields in org.jgrapht.traverse with type parameters of type ClosestFirstIterator.QueueEntry

Modifier and Type	Field	Description
private org.jheaps.AddressableHeap<Double, ClosestFirstIterator.QueueEntry<V,E>>	ClosestFirstIterator.heap	Priority queue of fringe vertices.

Constructor parameters in org.jgrapht.traverse with type arguments of type ClosestFirstIterator.QueueEntry

Modifier	Constructor	Description
	ClosestFirstIterator(Graph<V,E> g, Iterable<V> startVertices, double radius, Supplier<org.jheaps.AddressableHeap<Double, ClosestFirstIterator.QueueEntry<V,E>>> heapSupplier)	Creates a new radius-bounded closest-first iterator for the specified graph.
	ClosestFirstIterator(Graph<V,E> g, V startVertex, double radius, Supplier<org.jheaps.AddressableHeap<Double, ClosestFirstIterator.QueueEntry<V,E>>> heapSupplier)	Creates a new radius-bounded closest-first iterator for the specified graph.