Dfs and checking cycles
<p>I have a bipartite graph with a source and sync  node on each end as the start and end nodes. I am having trouble implementing the following java code to recursively find augmenting paths using DFS.  Any suggestions or corrections to my code would be great.</p>

<pre><code>List&lt;Edge&gt; Dfs(Node start, Node end, List&lt;Edge&gt;result){
        if(start.equals(end))
            return result;
        }
        for (Edge e : start.node_edges){
            e.start.visited = true;
            if(e.end.visited ==true){
                continue;}

            if(e.end.visited == false){
                if(e.capacity-e.flow &gt; 0){
                result.add(e);}
            }
            e.end.visited = true;
            if(result!=null){
                return Dfs(e.end, end, result);
            }
            result.remove(e);
            }

        return null;
    }
}   
</code></pre>
