How to find total number of simple paths b/w every pair of nodes in polynomial time for directed graph ?

Revision en1, by deepkamal, 2021-04-18 11:30:54

So, I was looking at the editorial of 167E - Wizards and Bets, It askes us to find total number of simple paths from every node (with indegree zero) to every node (with outdegree zero). How do we solve this ?. Also can we solve for any given directed graph the total number of simple paths b/w every pair of nodes in polynomial time ?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English deepkamal 2021-04-18 11:30:54 430 Initial revision (published)