How to detect if a directed graph is cyclic?

Posted by iva123 on Stack Overflow See other posts from Stack Overflow or by iva123
Published on 2010-03-26T17:22:08Z Indexed on 2010/03/26 17:43 UTC
Read the original article Hit count: 428

How can we detect if a directed graph is cyclic? I thought using breadth first search, but I'm not sure. Any ideas?

© Stack Overflow or respective owner

Related posts about graphs

Related posts about breadth-first-search