Topological Sorting and Cycles

For directed acyclic graphs, a topological order is constructed, useful in dependency problems. The presence of cycles alters the problem class and requires algorithms for finding strongly connected components