The length of the cycles could be related to N, and the number of the cycles could be exponentially related to N, so printing them in linear time is not possible, even if you could detect them. Don
On Jan 16, 12:00 am, marti <[email protected]> wrote: > Detect and *print *all the cycles present in a Directed Graph in linear > time. --
