void function ( int arg0 ) { if ( ! nodeMap . containsKey ( arg0 ) ) { GraphNode loc0 = new GraphNode ( arg0 ) ; nodeMap . put ( arg0 , loc0 ) ; numVertices ++ ; } }
add vertex with id ` num ' concode_field_sep int numVertices concode_elem_sep int numEdges concode_elem_sep List<GraphEdge> edges concode_elem_sep HashMap<Integer,GraphNode> nodeMap concode_field_sep SocialGraph buildSCCFromList concode_elem_sep void doBfsAllVertices concode_elem_sep void DFSVisit concode_elem_sep HashMap<Integer,HashSet<Integer>> exportGraph concode_elem_sep void printBetweenness concode_elem_sep void main concode_elem_sep int getNumVertices concode_elem_sep void distributeFlow concode_elem_sep void BFS concode_elem_sep List<List<Integer>> DFS concode_elem_sep void removeEdge concode_elem_sep void printGraph concode_elem_sep List<SocialGraph> getSCCs concode_elem_sep CommunityDetection getTranspose concode_elem_sep int removeEdgesWithHighestBetweennness concode_elem_sep int getNumEdges concode_elem_sep void resetBetweenness concode_elem_sep List<SocialGraph> findCommunities concode_elem_sep void addEdge