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

Правка en1, от 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?

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Peregrine_Falcon 2019-07-19 10:17:28 244 Initial revision (published)