62     : G(&G), F(F), DFSNumber(0), LowLink(0) {  in Node()
192     assert(N->DFSNumber == -1 &&  in verify()
527     N->DFSNumber = N->LowLink = 0;  in switchInternalEdgeToRef()
539   TargetN.DFSNumber = TargetN.LowLink = -1;  in switchInternalEdgeToRef()
551     if (RootN->DFSNumber != 0) {  in switchInternalEdgeToRef()
552       assert(RootN->DFSNumber == -1 &&  in switchInternalEdgeToRef()
557     RootN->DFSNumber = RootN->LowLink = 1;  in switchInternalEdgeToRef()
568         if (ChildN.DFSNumber == 0) {  in switchInternalEdgeToRef()
575           ChildN.DFSNumber = ChildN.LowLink = NextDFSNumber++;  in switchInternalEdgeToRef()
583         if (ChildN.DFSNumber == -1) {  in switchInternalEdgeToRef()
596               N.DFSNumber = N.LowLink = -1;  in switchInternalEdgeToRef()
628       if (N->LowLink != N->DFSNumber)  in switchInternalEdgeToRef()
633       int RootDFSNumber = N->DFSNumber;  in switchInternalEdgeToRef()
640                          return N->DFSNumber < RootDFSNumber;  in switchInternalEdgeToRef()
647         N.DFSNumber = N.LowLink = -1;  in switchInternalEdgeToRef()
1009       N.DFSNumber = N.LowLink = 0;  in removeInternalRefEdge()
1015     N.DFSNumber = N.LowLink = -1;  in removeInternalRefEdge()
1029     if (RootN->DFSNumber != 0) {  in removeInternalRefEdge()
1030       assert(RootN->DFSNumber == -1 &&  in removeInternalRefEdge()
1035     RootN->DFSNumber = RootN->LowLink = 1;  in removeInternalRefEdge()
1045       assert(N->DFSNumber != 0 && "We should always assign a DFS number "  in removeInternalRefEdge()
1050         if (ChildN.DFSNumber == 0) {  in removeInternalRefEdge()
1057           ChildN.LowLink = ChildN.DFSNumber = NextDFSNumber++;  in removeInternalRefEdge()
1063         if (ChildN.DFSNumber == -1) {  in removeInternalRefEdge()
1112       if (N->LowLink != N->DFSNumber) {  in removeInternalRefEdge()
1119       int RootDFSNumber = N->DFSNumber;  in removeInternalRefEdge()
1126                          return N->DFSNumber < RootDFSNumber;  in removeInternalRefEdge()
1293     N->DFSNumber = N->LowLink = 0;  in buildSCCs()
1311     if (RootN->DFSNumber != 0) {  in buildSCCs()
1312       assert(RootN->DFSNumber == -1 &&  in buildSCCs()
1317     RootN->DFSNumber = RootN->LowLink = 1;  in buildSCCs()
1328         if (ChildN.DFSNumber == 0) {  in buildSCCs()
1335           ChildN.DFSNumber = ChildN.LowLink = NextDFSNumber++;  in buildSCCs()
1345         if (ChildN.DFSNumber == -1) {  in buildSCCs()
1365       if (N->LowLink != N->DFSNumber)  in buildSCCs()
1370       int RootDFSNumber = N->DFSNumber;  in buildSCCs()
1377                          return N->DFSNumber < RootDFSNumber;  in buildSCCs()
1383         N.DFSNumber = N.LowLink = -1;  in buildSCCs()
1429     } while (N->DFSNumber != 0);  in getNextRefSCCInPostOrder()
1432     N->LowLink = N->DFSNumber = 1;  in getNextRefSCCInPostOrder()
1442     assert(N->DFSNumber > 0 && "We should always assign a DFS number "  in getNextRefSCCInPostOrder()
1448       if (ChildN.DFSNumber == 0) {  in getNextRefSCCInPostOrder()
1455         ChildN.LowLink = ChildN.DFSNumber = NextDFSNumber++;  in getNextRefSCCInPostOrder()
1465       if (ChildN.DFSNumber == -1) {  in getNextRefSCCInPostOrder()
1485     if (N->LowLink != N->DFSNumber) {  in getNextRefSCCInPostOrder()
1492     int RootDFSNumber = N->DFSNumber;  in getNextRefSCCInPostOrder()
1499             [RootDFSNumber](Node *N) { return N->DFSNumber < RootDFSNumber; }));  in getNextRefSCCInPostOrder()