Open Vyom-Yadav opened 1 year ago
In DFS: https://github.com/SkienaBook/Algorithm-Design-Manual-Programs-V3/blob/9bdfcc0203956c354cfc9715559a8671a73684cb/bfs-dfs.c#L143-L144
time is incremented and then added to exit_time array.
time
exit_time
But in Psuedo Code on page 221:
exit[u] = time time = time + 1
The problem of how many descendants can be still solved, but this looks odd and buggy.
Thoughts @SkienaBook Sir?
In DFS: https://github.com/SkienaBook/Algorithm-Design-Manual-Programs-V3/blob/9bdfcc0203956c354cfc9715559a8671a73684cb/bfs-dfs.c#L143-L144
time
is incremented and then added toexit_time
array.But in Psuedo Code on page 221:
The problem of how many descendants can be still solved, but this looks odd and buggy.
Thoughts @SkienaBook Sir?