How to find total numbers of all minimum path between s and t through v in a graph?

0
votes

I want to find total number of all minimum path between s and t through v in a graph, where s,t and v are nodes of the graph, by using Floyd Warshall algorithm. Thanks in advance for yours answers.

1
graphshortest-pathfloyd-warshall
Hi, Welcome to stack overflow. Please refer the How to Ask link for more details on how to ask a question and update your question accordingly. – Jeroen Heier

1 Answers

0
votes

find the number of shortest paths between s and v with floyd-warshall, then find all shortest path from v to t and then multiple the result. for instance, if there are 3 shortest paths between s and v, 2 shortest path from v to t then there 6 shortest paths from s to t through v.