tsort.c | 109 static size_t find_cycle(NODE *, NODE *, size_t, size_t); 337 if ((cnt = find_cycle(n, n, 0, 0)) != 0) { 378 find_cycle(NODE *from, NODE *to, size_t longest_len, size_t depth) function in typeref:typename:size_t 402 len = find_cycle(*np, to, longest_len, depth + 1);
|