Algorithm to determine number of shortest paths between two nodes

Question

Allisson Shields

Physics

8 November, 05:11

Algorithm to determine number of shortest paths between two nodes

+4

Answers (1)

Know the Answer?

Ben Daniel · Answer 1

Search Results Use BFS to determine the length of the shortest v-w-path. Then use DFS to find thenumber of the v-w-shortest paths such that two nodes are connected and the length of path equals to the output of BFS. But the running time of this plan is O (m+n) + O (m+n). Also I've tried to modify the Dijkstra algorithm.