Find all paths through all edges between two nodes

See more:

Java

algorithm

graph

I am trying to figure out how to find all paths between to nodes through all edges, not vertices. Was thinking about visited[][], to check did edge was visited, but I came up with some problems. Maybe I there is simple way and I can't see it. Any ideas?

void allPathsDFS(int verticeFrom, int verticeTo, boolean[] visited, Deque<Integer> paths, List<List<Integer>> rezults){
    visited[verticeFrom] = true;
    paths.add(verticeFrom);
    if (verticeFrom == verticeTo){
        rezults.add(new ArrayList<Integer>(paths));
    }
    else{
        if(adj.containsKey(verticeFrom)){
            for(Integer i : adj.get(verticeFrom)){
                if(!visited[i] ){                                                        
                    allPathsDFS(i, verticeTo, visited, paths, rezults);
                }
            }
        }
    }
    paths.removeLast();
    visited[verticeFrom] = false;
}

What I have tried:

Visited Boolean[][] with pointing which edge was visited