toysolver-0.6.0: Assorted decision procedures for SAT, SMT, Max-SAT, PB, MIP, etc

Copyright(c) Masahiro Sakai 2018
LicenseBSD-style
Maintainermasahiro.sakai@gmail.com
Stabilityprovisional
Portabilityportable
Safe HaskellNone
LanguageHaskell2010

ToySolver.MaxCut

Description

 

Documentation

data Problem a Source #

Constructors

Problem 

Fields

Instances
Functor Problem Source # 
Instance details

Defined in ToySolver.MaxCut

Methods

fmap :: (a -> b) -> Problem a -> Problem b #

(<$) :: a -> Problem b -> Problem a #

Eq a => Eq (Problem a) Source # 
Instance details

Defined in ToySolver.MaxCut

Methods

(==) :: Problem a -> Problem a -> Bool #

(/=) :: Problem a -> Problem a -> Bool #

Ord a => Ord (Problem a) Source # 
Instance details

Defined in ToySolver.MaxCut

Methods

compare :: Problem a -> Problem a -> Ordering #

(<) :: Problem a -> Problem a -> Bool #

(<=) :: Problem a -> Problem a -> Bool #

(>) :: Problem a -> Problem a -> Bool #

(>=) :: Problem a -> Problem a -> Bool #

max :: Problem a -> Problem a -> Problem a #

min :: Problem a -> Problem a -> Problem a #

Show a => Show (Problem a) Source # 
Instance details

Defined in ToySolver.MaxCut

Methods

showsPrec :: Int -> Problem a -> ShowS #

show :: Problem a -> String #

showList :: [Problem a] -> ShowS #

fromEdges :: Num a => Int -> [(Int, Int, a)] -> Problem a Source #

edges :: Problem a -> [(Int, Int, a)] Source #

eval :: Num a => Solution -> Problem a -> a Source #

evalEdge :: Num a => Solution -> (Int, Int, a) -> a Source #