Safe Haskell	Safe-Inferred
Language	Haskell98

Data.Graph.Inductive.Monad.IOArray

Contents

Description

Static IOArray-based Graphs

Synopsis

Graph Representation

newtype SGr a b Source #

Constructors

Instances details

GraphM IO SGr Source #
Instance details Defined in Data.Graph.Inductive.Monad.IOArray Methods emptyM :: IO (SGr a b) Source # isEmptyM :: IO (SGr a b) -> IO Bool Source # matchM :: Node -> IO (SGr a b) -> IO (Decomp SGr a b) Source # mkGraphM :: [LNode a] -> [LEdge b] -> IO (SGr a b) Source # labNodesM :: IO (SGr a b) -> IO [LNode a] Source # matchAnyM :: IO (SGr a b) -> IO (GDecomp SGr a b) Source # noNodesM :: IO (SGr a b) -> IO Int Source # nodeRangeM :: IO (SGr a b) -> IO (Node, Node) Source # labEdgesM :: IO (SGr a b) -> IO [LEdge b] Source #
(Show a, Show b) => Show (IO (SGr a b)) Source #	Please note that this instance is unsafe.
Instance details Defined in Data.Graph.Inductive.Monad.IOArray Methods showsPrec :: Int -> IO (SGr a b) -> ShowS # show :: IO (SGr a b) -> String # showList :: [IO (SGr a b)] -> ShowS #
(Show a, Show b) => Show (SGr a b) Source #	Please note that this instance is unsafe.
Instance details Defined in Data.Graph.Inductive.Monad.IOArray Methods showsPrec :: Int -> SGr a b -> ShowS # show :: SGr a b -> String # showList :: [SGr a b] -> ShowS #

type USGr = SGr () () Source #

Utilities

filter list (of successors/predecessors) through a boolean ST array representing deleted marks