Lines Matching refs:nodeList
376 int *nodeList= new int [numVertex];
382 ProcessBegins (startPoint, endPoint, BEGINRULE_LABEL, nodeList, 0, visitList, numVertex);
385 delete [] nodeList;
397 int *nodeList= new int [numVertex];
403 ProcessEnds (endPoint, startPoint, ENDRULE_LABEL, nodeList, 0, visitList, numVertex);
406 delete [] nodeList;
418 int *nodeList= new int [numVertex];
424 ProcessBegins (startPoint, endPoint, NONE_LABEL, nodeList, 0, visitList, numVertex);
427 delete [] nodeList;
455 int *nodeList= new int [numVertex];
461 ProcessBegins (startPoint, endPoint, BEGINSCOPE_LABEL, nodeList, 0, visitList, numVertex);
465 delete [] nodeList;
471 int *nodeList, int currNum, int maxNum)
475 nodeList[currNum]= currId;
482 finalId, procLabel, nodeList, currNum+1, maxNum);
492 int *nodeList, int currNum, int *visitMark, int maxNum)
496 nodeList[currNum]= currId;
505 finalId, procLabel, nodeList, currNum, maxNum);
509 if (nextId >= 0 && nextId != finalId && checkEntry (nodeList, currNum, nextId) < 0
511 ProcessBegins (nextId, finalId, procLabel, nodeList, currNum+1, visitMark, maxNum);
527 int *nodeList= new int [numVertex];
533 ProcessEnds (endPoint, startPoint, ENDSCOPE_LABEL, nodeList, 0, visitList, numVertex);
537 delete [] nodeList;
543 int *nodeList, int currNum, int maxNum)
547 nodeList[currNum]= currId;
554 initialId, procLabel, nodeList, currNum+1, maxNum);
564 nodeList, int currNum, int *visitMark, int maxNum)
568 nodeList[currNum]= currId;
577 initialId, procLabel, nodeList, currNum, maxNum);
580 if (nextId != initialId && checkEntry (nodeList, currNum, nextId) < 0
582 ProcessEnds (nextId, initialId, procLabel, nodeList, currNum+1, visitMark, maxNum);
763 int *nodeList= new int [numVertex];
769 ProcessTags (endPoint, startPoint, nodeList, 0, visitList, numVertex);
773 delete [] nodeList;
779 int outTag, int *nodeList, int currNum, int maxNum)
784 nodeList[currNum]= currId;
791 arc[backwardList[rix]]->GetOutput(), nodeList, currNum+1, maxNum))
802 void SubGraph::ProcessTags (int currId, int initialId, int *nodeList, int currNum,
807 nodeList[currNum]= currId;
816 arc[backwardList[rix]]->GetOutput(), nodeList, currNum, maxNum))
820 if (nextId != initialId && checkEntry (nodeList, currNum, nextId) < 0
822 ProcessTags (nextId, initialId, nodeList, currNum+1, visitMark, maxNum);
