get the length of a shortest path . concode_field_sep double[][] d concode_elem_sep List<V> vertices concode_elem_sep int nShortestPaths concode_elem_sep Map<VertexPair<V>,GraphPath<V,E>> paths concode_elem_sep double diameter concode_elem_sep int[][] backtrace concode_elem_sep Graph<V,E> graph concode_field_sep double getDiameter concode_elem_sep void lazyCalculatePaths concode_elem_sep Graph<V,E> getGraph concode_elem_sep GraphPath<V,E> getShortestPath concode_elem_sep void shortestPathRecur concode_elem_sep GraphPath<V,E> getShortestPathImpl concode_elem_sep void lazyCalculateMatrix concode_elem_sep int getShortestPathsCount concode_elem_sep List<GraphPath<V,E>> getShortestPaths
double function ( V arg0 , V arg1 ) { lazyCalculateMatrix ( ) ; return d [ vertices . indexOf ( arg0 ) ] [ vertices . indexOf ( arg1 ) ] ; }