a graph has a cycle if and only if depth-first search produces a back edge if there are concode_field_sep boolean visitedAdded concode_elem_sep Iterator<Stmt> it concode_elem_sep Stmt stmt concode_field_sep void rebuild concode_elem_sep void init concode_elem_sep void transform concode_elem_sep List<Stmt> topologicalSort concode_elem_sep void dfsStackRemove concode_elem_sep void dfsRecursiveCallRemove concode_elem_sep Item buildItem concode_elem_sep void link concode_elem_sep void reverseIF concode_elem_sep void init_ts_default_next
void function ( StmtList arg0 ) { if ( arg0 . getSize ( ) < 50 ) { dfsRecursiveCallRemove ( arg0 . getFirst ( ) , new HashSet < Stmt > ( ) ) ; } else { dfsStackRemove ( arg0 . getFirst ( ) , new HashSet < Stmt > ( ) ) ; } }