Lines Matching defs:firstId
63 bool SubGraph::EquivalenceTestForward (int firstId, int secondId, int *equivMap)
67 assert (firstId != secondId);
68 fix= FindFromIndex (firstId);
77 while (fix < numArc && arc[forwardList[fix]]->GetFromId() == firstId
80 if (fix < numArc && arc[forwardList[fix]]->GetFromId() == firstId)
93 if (fnxt != firstId && snxt != secondId)
95 else if (fnxt != firstId || snxt != secondId)
184 int fix, six, firstId, secondId, vertEnd;
199 firstId= -1;
202 // Iterator for firstId
204 && (arc[forwardList[fix]]->GetToId() == firstId
213 firstId= arc[forwardList[fix]]->GetToId();
217 secondId= firstId;
234 assert (firstId >= 0);
239 if (PairwiseDeterminize (baseId, firstId, fix, secondId, six, cache) > 0) {
249 || arc[forwardList[fix]]->GetToId() != firstId)
257 int SubGraph::PairwiseDeterminize (int baseId, int firstId, int fixStart, int secondId,
281 newId= cache->QueryEntry (firstId, secondId);
286 // printf ("Forming %d with %d and %d at %d\n", newId, firstId, secondId, baseId);
300 || arc[forwardList[fix]]->GetToId() != firstId)
317 || arc[forwardList[fix]]->GetToId() != firstId)
337 MergeVertices (newId, firstId, secondId);
338 cache->AddEntry (newId, firstId, secondId);
346 // printf ("Merging %d %d to create %d\n", firstId, secondId, newId);
350 DecVisitationCache (firstId);
357 void SubGraph::MergeVertices (int newId, int firstId, int secondId)
363 fix= FindFromIndex (firstId);
367 while (fix < sortNum && arc[forwardList[fix]]->GetFromId() == firstId) {
385 if (arc[forwardList[fix]]->GetToId() == firstId
403 if (fix >= sortNum || arc[forwardList[fix]]->GetFromId() != firstId
404 || arc[forwardList[fix]]->GetFromId() != firstId)
418 if (fix >= sortNum || arc[forwardList[fix]]->GetFromId() != firstId
419 || arc[forwardList[fix]]->GetFromId() != firstId)
433 while (fix < sortNum && arc[forwardList[fix]]->GetFromId() == firstId) {
452 // printf ("Merging %d %d to create %d\n", firstId, secondId, newId);
