public Collection<Deque<E>> computeOptimalPaths(V src, V dst) {
		return sources.get(src).computeOptimalPathsTo(dst);
	}
Compute the shortest paths from the given source to the given destination

<p>
This implementation differs from typical implementations in that paths tied for the shortest
distance are all returned. Others tend to choose one arbitrarily.

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