protected void fillStep(V from, double dist) {
			for (E e : graph.getOutEdges(from)) {
				double newDist = dist + metric.computeWeight(e);
				if (newDist > maxDistance) {
					continue;
				}
				V dest = e.getEnd();
				if (addOrUpdate(dest, newDist)) {
					bestIns.get(dest).add(e);
				}
			}
		}
Perform one iteration of Dijskstra's path finding algorithm

@param from the vertex to visit for this iteration
Ghidra/Framework/Graph/src/main/java/ghidra/graph/algo/DijkstraShortestPathsAlgorithm.java