All pathways algorithm

[hanniballector]

Hey guys,
I am a C noob so I have a pretty basic question. Does anyone know of a way to output all possible paths between 2 points on a graph. I know I can use either Floyd Warshall or Dijisktra to print out the shortest pathway, but I need all possible paths printed out in a single text file.
I have been thinking about it for a couple of weeks now but I cant really find any thing. Could some C guru help me out? I don't need help with the code, but I would really appreciate some guidance as how to go about programming it or a pseudo code or perhaps an academic paper that deals with the topic.
Thanks!

Edit: My input is a matrix of distances between all possible nodes(imagine cities(a & b) as nodes and the distance between 2 cities as the matrix element ab)

[Adak]

Go to Wikipedia, or Google, and search for Depth First Search and Breadth First Search. Both are fully exhaustive, if you don't stop them, and find every possible point.

[hellork]

Consider a 2 x 2 grid. All possible paths from a to b would be a square.

a
*--*
|  |
*--*b

Now just recurse

Sorry... I couldn't resist!

Depends on whether or not you can cross paths.

[hanniballector]

Go to Wikipedia, or Google, and search for Depth First Search and Breadth First Search. Both are fully exhaustive, if you don't stop them, and find every possible point.

The BFS algorithm looks promising. I will report back once I (hopefully) get it working. Thanks for the help!