3 ms·
I counted six cycles ? 6,7,8,6 8,0,3,4,9,8 0,5,1,0 0,1,3,0 (are these not considered separate cycles ?) 8,0,5,1,3,4,9,8 0,5,1,3,0 Anyway, very n
by TheGrassyKnoll 11y ago
I counted six cycles ?
6,7,8,6
8,0,3,4,9,8
0,5,1,0
0,1,3,0
(are these not considered separate cycles ?)
8,0,5,1,3,4,9,8
0,5,1,3,0
Anyway, very nice presentation.
- maurizzzio 11y agoyou're right hehe I should rename the problem to finding the number of back edges in the dfs tree, thanks for the feedback