fgl-5.5.3.1: Martin Erwig's Functional Graph Library

Contents

Description

Static IOArray-based Graphs

Synopsis

# Graph Representation

newtype SGr a b Source #

Constructors

 SGr (GraphRep a b)

Instances

 Source # MethodsemptyM :: 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 not that this instance is unsafe. MethodsshowsPrec :: 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 not that this instance is unsafe. MethodsshowsPrec :: Int -> SGr a b -> ShowS #show :: SGr a b -> String #showList :: [SGr a b] -> ShowS #

type Context' a b = Maybe (Adj b, a, Adj b) Source #

type USGr = SGr () () Source #

emptyN :: Int -> IO (SGr a b) Source #

# Utilities

removeDel :: IOArray Node Bool -> Adj b -> IO (Adj b) Source #

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