This page cannot be shown here. You can still read it on the original site — the toolbar below keeps your place in the directory.
Detecting loops in a directed graph can be tricky, depending on how you define your loop. If you only want to admit "natural loops", where the header of the loop dominates every node in the body, as well as the footer, we have a simple algorithm. If you want to go to the other extreme, and define the most general "strongly connected components", without regard for loops, you have Tarjan's SCC…
Comments
Nothing yet. Say the first thing.
Sign in to join the conversation.