void function ( List < Node < T >> arg0 , Node < T > arg1 , Set < Node < T >> arg2 ) { if ( ! arg2 . contains ( arg1 ) ) { arg2 . add ( arg1 ) ; arg0 . add ( arg1 ) ; arg1 . num = arg0 . size ( ) ; for ( Iterator < Node < T >> loc0 = arg1 . succsOf ( ) ; loc0 . hasNext ( ) ; ) { dfs_recursive ( arg0 , loc0 . next ( ) , arg2 ) ; } } }
a recursive approach to the depth first search algorithm if the root parameter sent in is null , it starts the search from the head nodes of the graph warning : this method can result in a stackoverflowerror if the graph has to many nodes since the callstack will exceed the size of the stack . . concode_field_sep PlaceHolder placeHolder concode_field_sep List<Node<T>> dfs concode_elem_sep List<Node<T>> dfs concode_elem_sep List<Node<T>> dfs_iterative concode_elem_sep boolean isCyclic concode_elem_sep List<Node<T>> topSort concode_elem_sep List<Node<T>> postOrder concode_elem_sep void postOrder concode_elem_sep List<Node<T>> postOrder concode_elem_sep List<Node<T>> postOrder