void function ( Object arg0 ) { List loc0 = new ArrayList ( ) ; loc0 . add ( arg0 ) ; this . perform ( loc0 . iterator ( ) ) ; }
performs the graph traversion with a single root element . so this root element and all elements which are reachable from this root elements will be visited . concode_field_sep int linkCount concode_elem_sep Map myVisitedElements concode_elem_sep Iterator myElements concode_elem_sep boolean done concode_field_sep boolean isVisited concode_elem_sep void beginVisit concode_elem_sep Iterator getElementLinks concode_elem_sep void endVisit concode_elem_sep void setVisited concode_elem_sep int visit concode_elem_sep int getVisitedDepth