unique paths in a graph

Is there a way to find all unique paths from one node to another? for example, the path 1-2-4-5 and 1-2-3-5 are different.
I am trying to find all paths connecting the two nodes, not including cycles. 
Is there an algorithm to implement this?

Thanks.