void function ( int arg0 ) { if ( ! nodeMap . containsKey ( arg0 ) ) { GraphNode loc0 = new GraphNode ( arg0 ) ; nodeMap . put ( arg0 , loc0 ) ; adjListMap . put ( arg0 , loc0 . getEdges ( ) ) ; numVertices ++ ; } }
add the vertex ` num ' to the graph concode_field_sep int numVertices concode_elem_sep int numEdges concode_elem_sep HashSet<Integer> edges concode_elem_sep HashMap<Integer,HashSet<Integer>> adjListMap concode_elem_sep int id concode_elem_sep HashMap<Integer,GraphNode> nodeMap concode_field_sep Graph buildSCCFromList concode_elem_sep void DFSVisit concode_elem_sep HashMap<Integer,HashSet<Integer>> exportGraph concode_elem_sep void main concode_elem_sep int getID concode_elem_sep int getNumVertices concode_elem_sep void addDirectedEdge concode_elem_sep List<List<Integer>> DFS concode_elem_sep List<Graph> getSCCs concode_elem_sep void printGraph concode_elem_sep CapGraph getTranspose concode_elem_sep Graph getEgonet concode_elem_sep int getNumEdges concode_elem_sep HashSet<Integer> getEdges concode_elem_sep void addEdge concode_elem_sep boolean containsNode