Searched refs:numVertex (Results 1 – 6 of 6) sorted by relevance
184 blockCount= numVertex - startId - 1; in CloseScope()202 blockCount= numVertex - startId - 1; in CloseScope()220 blockCount= numVertex - startId; in CloseScope()226 blockCount= numVertex - startId; in CloseScope()312 CopyFastArcs (subList[ruleId], 0, subList[ruleId]->numArc, numVertex, in ExpandRules()337 numVertex= maxVertId; in UpdateVertexCount()338 else if (numVertex < maxVertId) in UpdateVertexCount()339 numVertex= maxVertId; in UpdateVertexCount()376 int *nodeList= new int [numVertex]; in RemoveRuleStarts()377 int *visitList= new int [numVertex]; in RemoveRuleStarts()[all …]
37 numVertex= baseG->numVertex; in SubGraph()54 return (numVertex++); in NewVertexId()220 int *forwardDepth= new int [numVertex]; in RemoveUnvisitedArcs()221 int *reverseDepth= new int [numVertex]; in RemoveUnvisitedArcs()223 for (ii= 0; ii < numVertex; ii++) in RemoveUnvisitedArcs()233 for (ii= 0; ii < numVertex; ii++) { in RemoveUnvisitedArcs()
125 for (ii= 0; ii < numVertex; ii++) { in IdentifyEquivalence()134 for (ii= 0; ii < numVertex; ii++) in IdentifyEquivalence()137 for (jj= ii+1; jj < numVertex; jj++) in IdentifyEquivalence()542 int *nodeCount= new int [numVertex]; in VisitationConsistencyCheck()547 for (ii= 0; ii <numVertex; ii++) { in VisitationConsistencyCheck()558 for (ii= 0; ii <numVertex; ii++) in VisitationConsistencyCheck()
381 if (numVertex > 0) { in RenumberNodes()382 int *mapList= new int [numVertex]; in RenumberNodes()383 for (ii= 0; ii < numVertex; ii++) in RenumberNodes()395 for (ii= 0; ii < numVertex; ii++) in RenumberNodes()
114 numVertex= 0; in SubGraph()206 int numVertex; variable
360 int *nodeList= new int [numVertex]; in MarkNodesByOutputAndClearArcs()361 for (ii= 0; ii < numVertex; ii++) in MarkNodesByOutputAndClearArcs()