int [ ] [ ] function ( ) { if ( adj != null ) { return adj ; } int loc0 = V . length ; int [ ] [ ] loc1 = new int [ loc0 ] [ loc0 ] ; for ( int [ ] loc2 : loc1 ) { Arrays . fill ( loc2 , 0 ) ; } for ( LEdge loc2 : E ) { loc1 [ loc2 . v1 ] [ loc2 . v2 ] = loc2 . label + 1 ; loc1 [ loc2 . v2 ] [ loc2 . v1 ] = loc2 . label + 1 ; } adj = loc1 ; return loc1 ; }
adjacency matrix where each entry is the edge_label +1 or 0 if there is no edge . concode_field_sep ByteArray ucode concode_elem_sep LEdge[] E concode_elem_sep int[] V concode_elem_sep ByteArray finger concode_elem_sep String id concode_elem_sep int[][] adj concode_field_sep ByteArray finger concode_elem_sep int hashCode concode_elem_sep boolean equals concode_elem_sep ByteArray ucode