DFS
type GForest = [GTree] Source #
data GTree Source #
Constructors
postorder :: GForest -> [Int] Source #
list_tree :: GTree -> [Int] Source #
type Graph = (Int, Int -> [Int]) Source #
type Edge = (Int, Int) Source #
mk_graph :: Int -> [Edge] -> Graph Source #
vertices :: Graph -> [Int] Source #
out :: Graph -> Int -> [Int] Source #
edges :: Graph -> [Edge] Source #
rev_edges :: Graph -> [Edge] Source #
reverse_graph :: Graph -> Graph Source #
t_close :: Graph -> Graph Source #
scc :: Graph -> GForest Source #
top_sort :: Graph -> [Int] Source #
dff :: Graph -> GForest Source #
dff' :: [Int] -> Graph -> GForest Source #
generate_g :: (Int -> [Int]) -> Int -> GTree Source #
prune :: GForest -> GForest Source #
chop :: (Set Int, GForest) -> (Set Int, GForest) Source #