Lines Matching refs:dfsnum
78 uint dfsnum = DFS( tarjan );
79 if( dfsnum-1 != _num_blocks ) {// Check for unreachable loops!
80 // If the returned dfsnum does not match the number of blocks, then we
421 int dfsnum = NTarjan::DFS( ntarjan, visited, this, dfsorder);
427 for( i = dfsnum-1; i>1; i-- ) { // For all nodes in reverse DFS order
482 for( i=2; i < dfsnum; i++ ) { // DFS order
496 for( i=1; i<dfsnum; i++ ) { // For all Tarjan vertices
527 int dfsnum = 1;
528 dfsorder[b->_idx] = dfsnum; // Cache parent's dfsnum for a later use
534 NTarjan *w = &ntarjan[dfsnum];
537 // Use parent's cached dfsnum to identify "Parent in DFS"
539 dfsorder[b->_idx] = dfsnum; // Save DFS order info
540 w->_semi = dfsnum; // Node to DFS map
552 dfsorder[s->_idx] = dfsnum; // Cache parent's dfsnum for a later use
556 dfsnum++; // update after parent's dfsnum has been cached.
560 return dfsnum;