Lines Matching full:traversal
23 * Since graph traversal may enter a SCC at any position, an initial representation may be rotated,
101 // traversal of all loops using Gerlek's algorithm. The order is important to enable
194 // or assigned in inner loop (inner exit value), the traversal stops.
