Briggs.h | 104 unsigned worst, reverseWorst; member in struct:PBQP::Heuristics::Briggs::EdgeData 108 EdgeData() : worst(0), reverseWorst(0), isUpToDate(false) {} 322 ed.worst = 0; 338 if (colInfCounts[j] > ed.worst) { 339 ed.worst = colInfCounts[j]; 367 nd.numDenied += nIsNode1 ? ed.worst : ed.reverseWorst; 394 nd.numDenied -= nIsNode1 ? ed.worst : ed.reverseWorst;
|