// Creates a default list graph; logic borrowed from ajduberstein ListGraph::ListGraph(int numNodes){ num_edges = 0; edgeList = std::vector<EList>(); for(int i = 0; i < numNodes; i++){ edgeList.push_back(EList(NULL)); } }
ListGraph::ListGraph(int numNodes){ num_edges = 0; if(numNodes>0){ for(int i = 0; i < numNodes; i++){ edgeList.push_back(EList(NULL)); } } }