// reverse topological order of the SCC DAG.
//--------------------------------------------------------------------------
// reverse topological order of the SCC DAG.
//--------------------------------------------------------------------------
-const unsigned long MAXLONG = (1 << (8 * sizeof(unsigned long) - 1));
-
namespace {
Statistic<> NumSCCs("NumSCCs", "Number of Strongly Connected Components");
Statistic<> MaxSCCSize("MaxSCCSize", "Size of largest Strongly Connected Component");
namespace {
Statistic<> NumSCCs("NumSCCs", "Number of Strongly Connected Components");
Statistic<> MaxSCCSize("MaxSCCSize", "Size of largest Strongly Connected Component");
do {
CurrentSCC.push_back(SCCNodeStack.top());
SCCNodeStack.pop();
do {
CurrentSCC.push_back(SCCNodeStack.top());
SCCNodeStack.pop();
- nodeVisitNumbers[CurrentSCC.back()] = MAXLONG;
+ nodeVisitNumbers[CurrentSCC.back()] = ~0UL;
} while (CurrentSCC.back() != visitingN);
++NumSCCs;
} while (CurrentSCC.back() != visitingN);
++NumSCCs;
// reverse topological order of the SCC DAG.
//--------------------------------------------------------------------------
// reverse topological order of the SCC DAG.
//--------------------------------------------------------------------------
-const unsigned long MAXLONG = (1 << (8 * sizeof(unsigned long) - 1));
-
namespace {
Statistic<> NumSCCs("NumSCCs", "Number of Strongly Connected Components");
Statistic<> MaxSCCSize("MaxSCCSize", "Size of largest Strongly Connected Component");
namespace {
Statistic<> NumSCCs("NumSCCs", "Number of Strongly Connected Components");
Statistic<> MaxSCCSize("MaxSCCSize", "Size of largest Strongly Connected Component");
do {
CurrentSCC.push_back(SCCNodeStack.top());
SCCNodeStack.pop();
do {
CurrentSCC.push_back(SCCNodeStack.top());
SCCNodeStack.pop();
- nodeVisitNumbers[CurrentSCC.back()] = MAXLONG;
+ nodeVisitNumbers[CurrentSCC.back()] = ~0UL;
} while (CurrentSCC.back() != visitingN);
++NumSCCs;
} while (CurrentSCC.back() != visitingN);
++NumSCCs;