Graphs.FindCycle

The function in this module finds a cycle in a given directed graph, if one exists.

Documentation

findCycle :: Ord a => [a] -> (a -> [a]) -> Maybe [a]

Find a cycle in a graph. We are given a list of nodes to start from, and a successor function.