protected void addPathsTo(Collection<Deque<E>> paths, V dst) {
			addPathsTo(paths, dst, new LinkedList<>());
		}
Add the shortest paths from the source to the given destination into the given collection

<p>
This is used internally to recover the shortest paths

@param paths a place to store the recovered paths
@param dst the destination
Ghidra/Framework/Graph/src/main/java/ghidra/graph/algo/DijkstraShortestPathsAlgorithm.java