Iterable < DirectedEdge > function ( int arg0 ) { if ( ! hasPathTo ( arg0 ) ) return null ; Stack < DirectedEdge > loc0 = new Stack < DirectedEdge > ( ) ; for ( DirectedEdge loc1 = edgeTo [ arg0 ] ; loc1 != null ; loc1 = edgeTo [ loc1 . from ( ) ] ) { loc0 . push ( loc1 ) ; } return loc0 ; }
returns a shortest path from the source vertex s to vertex v. concode_field_sep IndexMinPQ<Double> pq concode_elem_sep DirectedEdge[] edgeTo concode_elem_sep double[] distTo concode_field_sep double distTo concode_elem_sep void relax concode_elem_sep boolean hasPathTo concode_elem_sep void main concode_elem_sep boolean check