Safe Haskell	Safe-Inferred
Language	Haskell2010

HGraph.Directed.Connectivity

Synopsis

reachable :: forall a t. (Adjacency t, Ord a) => t a -> a -> a -> Bool
allPaths :: (Ord t1, Adjacency t2) => t2 t1 -> t1 -> t1 -> [[t1]]
allLinkages :: (DirectedGraph t1, Adjacency t1, Eq b, Eq t2, Num t2) => t1 b -> t2 -> b -> b -> [[[b]]]
allMaximalPaths :: (DirectedGraph t, Adjacency t) => t b -> [[b]]
data LinkageInstance a = LinkageInstance {
- liTerminalPairs :: Map Int (a, a)
- liLinkage :: Map a Int
- liPath :: Map Int [a]
}
module HGraph.Directed.Connectivity.Flow
module HGraph.Directed.Connectivity.IntegralLinkage

Documentation

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

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

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

allMaximalPaths :: (DirectedGraph t, Adjacency 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.

data LinkageInstance a Source #

Constructors

LinkageInstance
Fields liTerminalPairs :: Map Int (a, a) liLinkage :: Map a Int liPath :: Map Int [a]

module HGraph.Directed.Connectivity.Flow

module HGraph.Directed.Connectivity.IntegralLinkage