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;
}