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?
Whenever they ask for shortest paths in a graph, it is a safe bet that some form of BFS is called for (you need to first check the neighbors of the starting point, if none qualifies you need to check all their neighbors, and so on. I.e., BFS).
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
Consider the case $k=1$ first. Can you use BFS or DFS? Now try to generalize.