Method computePaths

src/main/java/field/utility/Dijkstra.java:25–46

(t_vertex source)

	Map<t_vertex, Pair<t_vertex, t_edge>> previous = new HashMap<>();

	public void computePaths(t_vertex source) {
		minDistance.put(source, 0f);
		PriorityQueue<t_vertex> vertexQueue = new PriorityQueue<>((o1, o2) -> Float.compare(minDistance.computeIfAbsent(o1, (k) -> Float.POSITIVE_INFINITY), minDistance.computeIfAbsent(o2, (k) -> Float.POSITIVE_INFINITY)));

		vertexQueue.add(source);

		while (!vertexQueue.isEmpty()) {
			t_vertex u = vertexQueue.poll();
			for (t_edge e : edgesFor.apply(u)) {
				t_vertex v = output.apply(e);
				double weight = length.apply(e).doubleValue();
				double min = minDistance.computeIfAbsent(u, (k) -> Float.POSITIVE_INFINITY);
				double distanceThroughU = min + weight;
				if (distanceThroughU < minDistance.computeIfAbsent(v, (k) -> Float.POSITIVE_INFINITY)) {
					vertexQueue.remove(v);
					minDistance.put(v, (float) distanceThroughU);
					previous.put(v, new Pair<>(u, e));
					vertexQueue.add(v);
				}
			}
		}
	}

	public List<Pair<t_vertex, t_edge>> getShortestPathTo(t_vertex target) {
		if (!previous.containsKey(target)) return null;