| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
HGraph.Undirected.Solvers.Treedepth
Documentation
optimalDecomposition :: (Adjacency t, Mutable t, Ord a) => t a -> Decomposition a Source #
treedepthAtMost :: (Adjacency t, Num a1, Mutable t, Ord a2, Eq a1) => t a2 -> a1 -> Maybe (Decomposition a2) Source #
isDecomposition :: (Ord a, UndirectedGraph t) => t a -> Decomposition a -> Bool Source #
data Decomposition a Source #
Constructors
| Decomposition | |
Instances
| Eq a => Eq (Decomposition a) Source # | |
Defined in HGraph.Undirected.Solvers.Treedepth Methods (==) :: Decomposition a -> Decomposition a -> Bool # (/=) :: Decomposition a -> Decomposition a -> Bool # | |
| (Ord a, Show a) => Show (Decomposition a) Source # | |
Defined in HGraph.Undirected.Solvers.Treedepth Methods showsPrec :: Int -> Decomposition a -> ShowS # show :: Decomposition a -> String # showList :: [Decomposition a] -> ShowS # | |