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)