Graph traversal

[sadon]

Hello,

I have this simple map and im trying to find all the paths between any two nodes.

A
|
B-C
|\|
D-E

I created a matrix "paths[6][2]" to contain all the adjacent nodes like this:

A B
B C
B D
B E
C E
D E

what is the way to find the all paths between any start and end node?

thanks

[jsmith]

There are well-known path-finding algorithms available. I suggest googling "graph traversal algorithms"