set-cover-0.1: Solve exact set cover problems like Sudoku, 8 Queens, Soma Cube, Tetris Cube
Math.SetCover.BitPriorityQueue
data Queue bits e Source #
null :: Queue bits e -> Bool Source #
fromSets :: (Enum e, C bits) => EnumMap e (Set bits) -> Queue bits e Source #
elemUnions :: Enum e => Queue t e -> EnumSet e Source #
partition :: (C bits, Enum e) => Queue bits e -> Set bits -> (Queue bits e, Queue bits e) Source #
difference :: (C bits, Enum e) => Queue bits e -> Queue bits e -> Queue bits e Source #
findMin :: C bits => Queue bits e -> Maybe (EnumSet e) Source #
findMinValue :: C bits => Queue bits e -> Maybe (Set bits, EnumSet e) Source #