Graph function ( int arg0 ) { Graph loc0 = new Graph ( arg0 ) ; int [ ] loc1 = new int [ arg0 ] ; for ( int loc2 = 0 ; loc2 < arg0 ; loc2 ++ ) loc1 [ loc2 ] = loc2 ; StdRandom . shuffle ( loc1 ) ; for ( int loc2 = 0 ; loc2 < arg0 - 1 ; loc2 ++ ) { loc0 . addEdge ( loc1 [ loc2 ] , loc1 [ loc2 + 1 ] ) ; } loc0 . addEdge ( loc1 [ arg0 - 1 ] , loc1 [ 0 ] ) ; return loc0 ; }
returns a cycle graph on v vertices . concode_field_sep int v concode_elem_sep int w concode_field_sep Graph path concode_elem_sep Graph star concode_elem_sep Graph wheel concode_elem_sep Graph tree concode_elem_sep Graph binaryTree concode_elem_sep Graph simple concode_elem_sep Graph simple concode_elem_sep Graph bipartite concode_elem_sep Graph bipartite concode_elem_sep void main concode_elem_sep int compareTo concode_elem_sep Graph complete concode_elem_sep Graph regular concode_elem_sep Graph completeBipartite