Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Darcs.Util.Graph
Synopsis
- type Graph = Vector VertexSet
- type Vertex = Int
- type VertexSet = [Vertex]
- data Component = Component Graph VertexSet
- ltmis :: (Bool, Bool) -> Component -> [VertexSet]
- bkmis :: Graph -> [VertexSet]
- components :: Graph -> [Component]
- genGraphs :: Int -> [Graph]
- genComponents :: Int -> [Component]
- prop_ltmis_eq_bkmis :: Graph -> Bool
- prop_ltmis_maximal_independent_sets :: Component -> Bool
- prop_ltmis_all_maximal_independent_sets :: Component -> Bool
- prop_components :: Graph -> Bool
Documentation
Algorithms
bkmis :: Graph -> [VertexSet] #
The classic Bron-Kerbosch algorithm for determining the maximal
independent sets in a Graph
.
components :: Graph -> [Component] #
Generating graphs
genComponents :: Int -> [Component] #
Properties
prop_ltmis_maximal_independent_sets :: Component -> Bool #
Whether ltmis
generates only maximal independent sets.
prop_ltmis_all_maximal_independent_sets :: Component -> Bool #
Whether ltmis
generates all maximal independent sets.
prop_components :: Graph -> Bool #
Complete specification of the components
function.