How to find all possible paths tracing as many edges between two vertices?

Questions
, , , , ,
1

Suppose I have an undirected graph

G = Graph[{1 <-> 2, 2 <-> 3, 2 <-> 3, 3 <-> 4}]

Untitled-1.png

I used FindPath[G,1,4,Infinity,All] and obtained the result

{{1, 2, 3, 4}}

But the expected result should be

{{1,2,3,4},{1,2,3,4}}

Is there any way to get all possible paths even though any number of edges are present in between two vertices?

2

If you cross post the same question on multiple forums, please always mention this and include links. This is so people will be aware of any existing solutions …