fn euler_recurse(&self, u: usize, adj: &mut [AdjListIterator], edges: &mut Vec<usize>) {
        while let Some((e, v)) = adj[u].next() {
            self.euler_recurse(v, adj, edges);
            edges.push(e);
        }
    }
// Helper function used by euler_path. Note that we can't consume the
// adjacency list in a for loop because recursive calls may need it.
Helper function used by euler_path. Note that we can't consume the
adjacency list in a for loop because recursive calls may need it.
Helper function used by euler_path . Note that we can ' t consume the adjacency list in a for loop because recursive calls may need it .
fn euler_recurse(&self, u: usize, adj: &mut [AdjListIterator], edges: &mut Vec<usize>) {
        while let Some((e, v)) = adj[u].next() {
            self.euler_recurse(v, adj, edges);
            edges.push(e);
        }
    }
fn euler_recurse ( & self , u : usize , adj : & mut [ AdjListIterator ] , edges : & mut Vec < usize > ) { while let Some ( ( e , v ) ) = adj [ u ] . next ( ) { self . euler_recurse ( v , adj , edges ) ; edges . push ( e ) ; } }
Helper function used by euler_path.
Helper function used by euler_path .
&self
u
usize
adj
&mut [AdjListIterator]
edges
&mut Vec<usize>
&self
u
usize
adj
&mut [AdjListIterator]
edges
&mut Vec<usize>