find all the paths between each couple of nodes in a graph

how can I find all the possible paths between each couple of nodes in a graph? Thanks in advance

Answer 1

[Walter Roberson]

Create the adjacency matrix and raise it to successive matrix powers.

If the graph is not a directed graph, then there will be an infinite number of possible paths. There might well be an infinite number anyhow.

For example,

A BCD BCD BCD BCD BCD BCD BCD BCD E is a quite plausible path between A and E if A->B, B->C, C->D, D->B and D->E

Perhaps you wanted to ask a slightly different question.

[Ethan Fan]

if it is undirected graph, it is possible to find all possible simple path(which means not pass a repeated node from the start point to the destination )?