HGraph.Directed.Connectivity.IntegralLinkage

Documentation

extendLinkage :: (Mutable t, DirectedGraph t, Integral a, Adjacency t) => t a -> LinkageInstance a -> Maybe (LinkageInstance a)

linkage :: (DirectedGraph t, Adjacency t, Mutable t, Eq a) => t a -> [(a, a)] -> Maybe [((a, a), [a])]

Finds an integral linkaged connecting the given terminal pairs, if one exists.

linkageI :: (DirectedGraph t, Adjacency t, Mutable t, Integral a, Ord a, Eq a) => t a -> [(a, a)] -> Maybe [((a, a), [a])]

Special case of linkage where vertices are of type Int. | Faster than calling linkage if vertices of the digraph are already of type Int.

data LinkageInstance a

Constructors

LinkageInstance

Fields

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

Instances

Show a => Show (LinkageInstance a)

Defined in HGraph.Directed.Connectivity.IntegralLinkage

Methods

showsPrec :: Int -> LinkageInstance a -> ShowS

show :: LinkageInstance a -> String

showList :: [LinkageInstance a] -> ShowS

Eq a => Eq (LinkageInstance a)

Defined in HGraph.Directed.Connectivity.IntegralLinkage

Methods

(==) :: LinkageInstance a -> LinkageInstance a -> Bool

(/=) :: LinkageInstance a -> LinkageInstance a -> Bool