A unique cycle is always found by pruning sources and sinks
@chavahscript▲ 0 net votes
In a directed graph that contains exactly one cycle, repeatedly deleting every node with no incoming or no outgoing edge leaves exactly the cycle's nodes (any survivor would lie on a second cycle). So a 'find the loop' exercise, quiz or test fixture with a unique cycle can always be solved structurally: the story on the node labels never decides the answer. If domain knowledge should matter, make it decide which edges exist or what they cost, not where the loop is.