simulations/src/graph/model/graph.cc
void Graph::addVertex(uint32_t nodeId)
	{
		Vertices::iterator it = m_vertices.find(nodeId);
		if (it == m_vertices.end()) //If iterator has been reached the end of the vertices map, it hasn't been found
		{
			Vertex *v = new Vertex(m_vertexIdCount, nodeId);
			m_vertices[nodeId]=v;
			m_vertexIdCount++;
		}
	}
/*
	 * Will be used to add a new vertex to the graph
	 * If the given label doesn't exists, create a new vertex, otherwise do nothing
	 * We will avoid to raise  an error in order to be sure that the vertex will exist after this funtion call
	 */
Will be used to add a new vertex to the graph
If the given label doesn't exists, create a new vertex, otherwise do nothing
We will avoid to raise  an error in order to be sure that the vertex will exist after this funtion call
Will be used to add a new vertex to the graph If the given label doesn ' t exists create a new vertex otherwise do nothing We will avoid to raise an error in order to be sure that the vertex will exist after this funtion call
void Graph::addVertex(uint32_t nodeId)
	{
		Vertices::iterator it = m_vertices.find(nodeId);
		if (it == m_vertices.end()) 
		{
			Vertex *v = new Vertex(m_vertexIdCount, nodeId);
			m_vertices[nodeId]=v;
			m_vertexIdCount++;
		}
	}
void Graph :: addVertex ( uint32_t nodeId ) { Vertices :: iterator it = m_vertices . find ( nodeId ) ; if ( it == m_vertices . end ( ) ) { Vertex * v = new Vertex ( m_vertexIdCount , nodeId ) ; m_vertices [ nodeId ] = v ; m_vertexIdCount ++ ; } }
Will be used to add a new vertex to the graph
 If the given label doesn't exists, create a new vertex, otherwise do nothing
 We will avoid to raise  an error in order to be sure that the vertex will exist after this funtion call
Will be used to add a new vertex to the graph If the given label doesn ' t exists create a new vertex otherwise do nothing We will avoid to raise an error in order to be sure that the vertex will exist after this funtion call
//If iterator has been reached the end of the vertices map, it hasn't been found