Data.IntGraph.Undirected.Algorithms

Documentation

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

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

vertexCoverBool :: IntGraph -> Int -> Bool

vertexCoverDec, but just returns true or false

vertexCover :: IntGraph -> [Node]

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