Do we need to use BFS or DFS algorithm to find the k shortest loopless paths in a graph between any two nodes? If so where can it be useful?
I would like to draw your attention to the Theorem 22.5:
"upon termination d.v = ð(s,v) for all v € V"
ð(s,v) ... the minimum number of edges from s to v