Graphs: All paths between u and v

[Script Coder]

Like the title says, I am trying to find all the paths between u and v in a graph.
The graphs properties:
1)Connected
2)Not necessarily simple
3)Undirected
4)Unweighted

How would I go about this. I would like to print the paths out. Is there an algorithm for it? (I have yet to find one)

[Peter87]

Can a path contain the same node twice?

[Script Coder]

No cycles are allowed

[Peter87]

I think this simple recursive algorithm should work.

findAllPaths(Node n, Path p, PathList& l)
	for all n's neighbour nodes m
		if m is not in p
			p' := p + m
			if m == v
				add p' to l
			else
				findAllPaths(m, p', l)

[Script Coder]

I think I have the solution, thank you.