Lines Matching refs:currId
47 void SubGraph::ViewNode (int currId)
51 printf ("Node: %d\n", currId);
52 rix= FindFromIndex (currId);
55 while (rix < numArc && arc[forwardList[rix]]->GetFromId() == currId) {
157 void SubGraph::CheckForChangeAndResort (int currId, int *mapList)
163 rixBegin= rix= FindFromIndex (currId);
166 while (rix < numArc && arc[forwardList[rix]]->GetFromId() == currId) {
487 void SubGraph::DecVisitationCache (int currId)
491 DecNodeProperty (currId);
492 // std::cout << " [" << currId << " " << QueryNodeProperty (currId) << "] ";
493 if (QueryNodeProperty (currId) <= 0) {
494 // std::cout << " [" << currId << "] ";
495 rix= FindFromIndex (currId);
498 while (rix < sortNum && arc[forwardList[rix]]->GetFromId() == currId) {
502 DecNodeProperty (currId);
512 void SubGraph::IncVisitationCache (int currId)
516 if (QueryNodeProperty (currId) <= 0) {
517 IncNodeProperty (currId);
518 // std::cout << " (" << currId << ") ";
519 rix= FindFromIndex (currId);
522 while (rix < sortNum && arc[forwardList[rix]]->GetFromId() == currId) {
526 // if (currId != arc[forwardList[rix]]->GetToId())
533 IncNodeProperty (currId);
534 // std::cout << " (" << currId << " " << QueryNodeProperty (currId) << ") ";
