HGraph.Undirected.Solvers.Treedepth

Documentation

optimalDecomposition :: (Adjacency t, Mutable t, Ord a) => t a -> Decomposition a

treedepthAtMost :: (Adjacency t, Num a, Mutable t, Ord a, Eq a) => t a -> a -> Maybe (Decomposition a)

isDecomposition :: (Ord k, UndirectedGraph t) => t k -> Decomposition k -> Bool

data Decomposition a

Constructors

Decomposition

Fields

• ancestor :: Map a a
• children :: Map a (Set a)
• depth :: Int
• roots :: [a]

Instances

(Ord a, Show a) => Show (Decomposition a)

Defined in HGraph.Undirected.Solvers.Treedepth

Methods

showsPrec :: Int -> Decomposition a -> ShowS

show :: Decomposition a -> String

showList :: [Decomposition a] -> ShowS

Eq a => Eq (Decomposition a)

Defined in HGraph.Undirected.Solvers.Treedepth

Methods

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

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