hgraph-1.2.0.1: Tools for working on (di)graphs.

Safe Haskell	Safe-Inferred
Language	Haskell2010

HGraph.Undirected.Solvers.IndependentSet

Synopsis

maximize :: (Adjacency t, Mutable t) => t a -> [a]
atLeast :: (Adjacency t, Mutable t) => t a -> Int -> Maybe [a]
reduce :: (Adjacency t, Mutable t) => t a -> Int -> (t a, [a], Int)

Documentation

maximize :: (Adjacency t, Mutable t) => t a -> [a] Source #

Find a maximum independet set in g

atLeast :: (Adjacency t, Mutable t) => t a -> Int -> Maybe [a] Source #

Search for an independent set of size at least k in g

reduce :: (Adjacency t, Mutable t) => t a -> Int -> (t a, [a], Int) Source #