boolean function ( int arg0 , int arg1 ) { return rows . get ( arg0 ) . contains ( arg1 ) ; }
returns if vertex i and j are connected . concode_field_sep ArrayList<TIntIntHashMap> commonNeighbors concode_elem_sep List<V> vertices concode_elem_sep TObjectIntHashMap<Vertex> vertexIndicies concode_elem_sep ArrayList<TIntArrayList> rows concode_field_sep int countTriangles concode_elem_sep int getIndex concode_elem_sep G getGraph concode_elem_sep void addEdgeInternal concode_elem_sep int countTriples concode_elem_sep V getVertex concode_elem_sep int getVertexCount concode_elem_sep int countEdges concode_elem_sep TIntArrayList getNeighbours concode_elem_sep void removeEdge concode_elem_sep void addEdges concode_elem_sep void adjustCommonNeighbors concode_elem_sep int getCommonNeighbors concode_elem_sep void synchronizeEdges concode_elem_sep void removeEdgeInternal concode_elem_sep int getNeighborCount concode_elem_sep int addVertex concode_elem_sep void addEdge