List < E > function ( ) { List < E > loc0 = new ArrayList < E > ( ) ; AbstractPathElement < V , E > loc1 = this ; while ( loc1 . getPrevEdge ( ) != null ) { loc0 . add ( loc1 . getPrevEdge ( ) ) ; loc1 = loc1 . getPrevPathElement ( ) ; } Collections . reverse ( loc0 ) ; return loc0 ; }
returns the path as a list of edges . concode_field_sep E prevEdge concode_elem_sep V vertex concode_elem_sep int nHops concode_elem_sep AbstractPathElement<V,E> prevPathElement concode_field_sep AbstractPathElement<V,E> getPrevPathElement concode_elem_sep int getHopCount concode_elem_sep E getPrevEdge concode_elem_sep V getVertex