Copyright | (c) Masahiro Sakai 2020 |
---|---|
License | BSD-style |
Maintainer | masahiro.sakai@gmail.com |
Stability | provisional |
Portability | non-portable |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
Documentation
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 #