The type of the heapSupplier-parameter in the constructor of .jgrapht.traverse.ClosestFirstIterator makes reference to the package-private class QueueEntry. So how can I ever hope to pass a heap supplier to the constructor?

    public ClosestFirstIterator(
        Graph<V, E> g, V startVertex, double radius,
        Supplier<AddressableHeap<Double, QueueEntry<V, E>>> heapSupplier)

I would like to use a custom heap so as to make the traversal more deterministic, by passing a heap implementation that respects the insertion order for elements with the same key (distance from the start vertex).

Is that a bug or am I missing something?