Lines Matching defs:secondId
63 bool SubGraph::EquivalenceTestForward (int firstId, int secondId, int *equivMap)
67 assert (firstId != secondId);
69 six= FindFromIndex (secondId);
85 while (six < numArc && arc[forwardList[six]]->GetFromId() == secondId
88 if (six < numArc && arc[forwardList[six]]->GetFromId() == secondId)
93 if (fnxt != firstId && snxt != secondId)
95 else if (fnxt != firstId || snxt != secondId)
184 int fix, six, firstId, secondId, vertEnd;
217 secondId= firstId;
220 // Iterator for secondId
222 && (arc[forwardList[six]]->GetToId() == secondId
231 secondId= arc[forwardList[six]]->GetToId();
235 assert (secondId >= 0);
239 if (PairwiseDeterminize (baseId, firstId, fix, secondId, six, cache) > 0) {
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);
307 || arc[forwardList[six]]->GetToId() != secondId)
326 || arc[forwardList[six]]->GetToId() != secondId)
337 MergeVertices (newId, firstId, secondId);
338 cache->AddEntry (newId, firstId, secondId);
346 // printf ("Merging %d %d to create %d\n", firstId, secondId, newId);
351 DecVisitationCache (secondId);
357 void SubGraph::MergeVertices (int newId, int firstId, int secondId)
364 six= FindFromIndex (secondId);
373 while (six < sortNum && arc[forwardList[six]]->GetFromId() == secondId) {
386 && arc[forwardList[six]]->GetToId() == secondId) {
410 if (six >= sortNum || arc[forwardList[six]]->GetFromId() != secondId)
427 if (six >= sortNum || arc[forwardList[six]]->GetFromId() != secondId
428 || arc[forwardList[six]]->GetFromId() != secondId)
439 while (six < sortNum && arc[forwardList[six]]->GetFromId() == secondId) {
452 // printf ("Merging %d %d to create %d\n", firstId, secondId, newId);
