Safe Haskell	Safe-Inferred
Language	Haskell2010

HGraph.Directed.Connectivity.Basic

Synopsis

reach :: (Adjacency t, Ord a) => t a -> a -> [a]
reverseReach :: (Adjacency t, Ord a) => t a -> a -> [a]
reachable :: forall {a} {t}. (Adjacency t, Ord a) => t a -> a -> a -> Bool
allPaths :: (Ord t, Adjacency t) => t t -> t -> t -> [[t]]
allLinkages :: (DirectedGraph t1, Adjacency t1, Eq b, Eq t2, Num t2) => t1 b -> t2 -> b -> b -> [[[b]]]
allMaximalPaths :: (Adjacency t, DirectedGraph t) => t b -> [[b]]
strongComponents :: (DirectedGraph t, Adjacency t, Mutable t, Ord a) => t a -> [[a]]

Documentation

reach :: (Adjacency t, Ord a) => t a -> a -> [a] Source #

Vertices that s can reach.

reverseReach :: (Adjacency t, Ord a) => t a -> a -> [a] Source #

reachable :: forall {a} {t}. (Adjacency t, Ord a) => t a -> a -> a -> Bool Source #

allPaths :: (Ord t, Adjacency t) => t t -> t -> t -> [[t]] Source #

allLinkages :: (DirectedGraph t1, Adjacency t1, Eq b, Eq t2, Num t2) => t1 b -> t2 -> b -> b -> [[[b]]] Source #

allMaximalPaths :: (Adjacency t, DirectedGraph t) => t b -> [[b]] Source #

All maximal paths on a digraph, represented as a list of vertices. | Cycles are also considered as maximal paths and their corresponding lists contain the initial vertex twice.

strongComponents :: (DirectedGraph t, Adjacency t, Mutable t, Ord a) => t a -> [[a]] Source #

All strongly connected components of a digraph, in an arbitrary order.