IntGraph-0.1.1.0: Dynamically sized graph library

Safe Haskell	Safe
Language	Haskell2010

Data.IntGraph.Directed.Algorithms

Synopsis

vertexCoverDec :: IntGraph -> Int -> Maybe [Node]
vertexCoverBool :: IntGraph -> Int -> Bool
vertexCover :: IntGraph -> [Node]

Documentation

vertexCoverDec :: IntGraph -> Int -> Maybe [Node] Source #

If there is a vertex cover of size k, returns the vertex cover | Otherwise Nothing | O(n*2^k)

vertexCoverBool :: IntGraph -> Int -> Bool Source #

vertexCoverDec, but just returns true or false

vertexCover :: IntGraph -> [Node] Source #

Optimal vertex cover | Not all that efficient, just keeps trying difference values for k