Question: find the total number of shortest paths between nodes s and t.
Edges doesn't have weight so we can't use dij. algo. I know how to apply bfs but unable to make count of different paths
Asked
Active
Viewed 98 times
0
Dominique Fortin
- 2,212
- 15
- 20
pk786
- 2,140
- 3
- 18
- 24
-
1@templatetypedef this is related to undirected graph. So please remove the tag duplicate from it – pk786 Mar 04 '17 at 21:55
-
can you show me an example how to apply because I am new to all this – pk786 Mar 04 '17 at 23:01