ToySolver.MaxCut

Documentation

data Problem a

Constructors

Problem

Fields

• numNodes :: !Int

  Number of nodes N. Nodes are numbered from 0 to N-1.

• numEdges :: !Int

  Number of edges.

• matrix :: IntMap (IntMap a)

  Non-zero entries of symmetric weight matrix

Instances

Functor Problem

Defined in ToySolver.MaxCut

Methods

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

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

Eq a => Eq (Problem a)

Defined in ToySolver.MaxCut

Methods

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

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

Ord a => Ord (Problem a)

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)

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

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

buildDSDPMaxCutGraph :: Problem Scientific -> Builder

buildDSDPMaxCutGraph' :: (a -> Builder) -> Problem a -> Builder

type Solution = UArray Int Bool

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

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