How to find the number of all possible paths in a undirected graph?

Revision en1, by Peregrine_Falcon, 2019-07-19 10:17:28

I've a graph consisting of 22 nodes and 36 edges. It's an undirected graph. From each node, I've to find the number of ways that I can reach all other nodes. Any idea please?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English Peregrine_Falcon 2019-07-19 10:17:28 244 Initial revision (published)