protected void fill() {
			Entry<V, Double> next;
			while ((next = queueByDistance.entrySet().poll()) != null) {
				// Mark it visited, and save the distance (may not need distance anymore....)
				visitedDistance.put(next.getKey(), next.getValue());
				fillStep(next.getKey(), next.getValue());
			}
		}
Compute paths, building out the graph until all reachable vertices have been visited
Ghidra/Framework/Graph/src/main/java/ghidra/graph/algo/DijkstraShortestPathsAlgorithm.java