Method addVertex

SRC/graph/graph/ArrayGraph.cpp:91–165

bool
ArrayGraph::addVertex(Vertex *vertexPtr)
{
    // check the vertex * and its adjacency list
    if (vertexPtr == 0) {
	opserr << "WARNING ArrayGraph::addVertex";
	opserr << " - attempting to add a NULL vertex*\n";
	return false;
    }
    
    if (vertexPtr->getDegree() != 0) {
	const ID &adjacency = vertexPtr->getAdjacency();
	int size = adjacency.Size();
	for (int i=0; i<size; i++) {
	    Vertex *other = this->getVertexPtr(adjacency(i));
	    if (other == 0) {
		opserr << "WARNING ArrayGraph::addVertex";
		opserr << " - vertex with adjacent vertex not in graph\n";
		return false;
	    }		
	}
    }

    // check if we have room to place the vertex
    if (numVertex == sizeVertices) {

	int newSize = sizeVertices*2;
	Vertex **newVertices = new Vertex *[newSize];
	
	if (newVertices == 0) {
	    opserr << "WARNING ArrayGraph::addVertex";
	    opserr << " - out of contiguous memory could not create a new array";
	    delete vertexPtr;
	    return false;
	}

	// copy the old and 0 the extra, then delete the old
	for (int i=0; i<sizeVertices; i++)
	    newVertices[i] = theVertices[i];
	for (int j=sizeVertices; j<newSize; j++)
	    newVertices[j] = 0;

	delete [] theVertices;
	
	theVertices = newVertices;
        sizeVertices = newSize;
    }
    
    // now see if we can add the Vertex into the array in its vertexTag location
    int vertexTag = vertexPtr->getTag();
    if ((vertexTag >= 0) && (vertexTag < sizeVertices) && 
	(theVertices[vertexTag] == 0)) {

	theVertices[vertexTag]= vertexPtr;
	numVertex++;
	return 0;

    } else {