10% increase in dynamic graph data structur
This commit is contained in:
		
							parent
							
								
									92f9a29de1
								
							
						
					
					
						commit
						c7dfed8f29
					
				| @ -136,7 +136,7 @@ class DynamicGraph { | |||||||
|                     m_edges[node.firstEdge] = m_edges[node.firstEdge + node.edges]; |                     m_edges[node.firstEdge] = m_edges[node.firstEdge + node.edges]; | ||||||
|                 } else { |                 } else { | ||||||
|                     EdgeIterator newFirstEdge = ( EdgeIterator ) m_edges.size(); |                     EdgeIterator newFirstEdge = ( EdgeIterator ) m_edges.size(); | ||||||
|                     unsigned newSize = node.edges * 1.2 + 2; |                     unsigned newSize = node.edges * 1.1 + 2; | ||||||
|                     EdgeIterator requiredCapacity = newSize + m_edges.size(); |                     EdgeIterator requiredCapacity = newSize + m_edges.size(); | ||||||
|                     EdgeIterator oldCapacity = m_edges.capacity(); |                     EdgeIterator oldCapacity = m_edges.capacity(); | ||||||
|                     if ( requiredCapacity >= oldCapacity ) { |                     if ( requiredCapacity >= oldCapacity ) { | ||||||
|  | |||||||
		Loading…
	
		Reference in New Issue
	
	Block a user