toysolver-0.7.0: Assorted decision procedures for SAT, SMT, Max-SAT, PB, MIP, etc
Copyright(c) Masahiro Sakai 2020
LicenseBSD-style
Maintainermasahiro.sakai@gmail.com
Stabilityprovisional
Portabilitynon-portable
Safe HaskellNone
LanguageHaskell2010

ToySolver.Graph.Base

Description

 

Documentation

type EdgeLabeledGraph a = Array Int (IntMap a) Source #

type Graph = EdgeLabeledGraph () Source #

graphToUnorderedEdges :: EdgeLabeledGraph a -> [(Int, Int, a)] Source #

graphFromUnorderedEdges :: Int -> [(Int, Int, a)] -> EdgeLabeledGraph a Source #

graphFromUnorderedEdgesWith :: (a -> a -> a) -> Int -> [(Int, Int, a)] -> EdgeLabeledGraph a Source #

isIndependentSet :: EdgeLabeledGraph a -> IntSet -> Bool Source #