Vertex* Graph::addVertex (vdata v, bool waken = false) { Vertex* newv = new Vertex (v); newv->waken = waken; allVertexes.push_back (newv); vertexMap.insert (vpair (v, newv)); return newv; }
// If vertexName is not present, add it to vertexMap // In either case, return the Vertex Vertex * Graph::getVertex( const string & vertexName ) { vmap::iterator itr = vertexMap.find( vertexName ); if( itr == vertexMap.end( ) ) { Vertex *newv = new Vertex( vertexName ); allVertices.push_back( newv ); vertexMap.insert( vpair( vertexName, newv ) ); return newv; } return (*itr).second; }
Vertex* Graph::addVertex (vdata v) { Vertex* newv = new Vertex (v); allVertexes.push_back (newv); vertexMap.insert (vpair (v, newv)); return newv; }
Vertex* BinaryTree::addVertex (int v) { Vertex* newv = new Vertex (v); allVertexes.push_back (newv); vertexMap.insert (vpair (v, newv)); return newv; }