Method merge

SRC/graph/graph/Graph.cpp:331–368

int
Graph::merge(Graph &other) {

  int result =0;
  VertexIter &otherVertices = other.getVertices();
  Vertex *vertexPtrOther;

  // loop through other creating vertices if tag not the same in this
  while ((vertexPtrOther = otherVertices()) != 0) {
    int vertexTag = vertexPtrOther->getTag();
    Vertex *vertexPtr = this->getVertexPtr(vertexTag);
    if (vertexPtr == 0) {
      int vertexRef = vertexPtrOther->getRef();
      vertexPtr = new Vertex(vertexTag, vertexRef);
      if (vertexPtr == 0) {
	opserr << "Graph::merge - out of memory\n";
	return -1;
      }
      this->addVertex(vertexPtr, false);
    }
  }


  // loop through other adding all the edges that exist in other
  VertexIter &otherVertices2 = other.getVertices();
  while ((vertexPtrOther = otherVertices2()) != 0) {
    int vertexTag = vertexPtrOther->getTag();
    const ID &adjacency = vertexPtrOther->getAdjacency();
    for (int i=0; i<adjacency.Size(); i++) {
      if (this->addEdge(vertexTag, adjacency(i)) < 0) {
	opserr << "Graph::merge - could not add an edge!\n";
	return -2;	
      }
    }
  }
  
  return result;
}


void