public Collection<Deque<E>> computeOptimalPathsTo(V dst) {
			Set<Deque<E>> paths = new HashSet<>();
			addPathsTo(paths, dst);
			return paths;
		}
Recover the shortest paths from the source to the given destination, if it is reachable

@param dst the destination
@return a collection of the shortest paths from source to destination, or the empty set
Ghidra/Framework/Graph/src/main/java/ghidra/graph/algo/DijkstraShortestPathsAlgorithm.java