edges-0.4.1: Tools for efficient immutable graphs

Safe HaskellNone
LanguageHaskell2010

Edges.Edges

Contents

Documentation

data Edges source target Source #

Instances
Eq (Edges a b) # 
Instance details

Defined in Edges.Edges

Methods

(==) :: Edges a b -> Edges a b -> Bool #

(/=) :: Edges a b -> Edges a b -> Bool #

Show (Edges a b) # 
Instance details

Defined in Edges.Edges

Methods

showsPrec :: Int -> Edges a b -> ShowS #

show :: Edges a b -> String #

showList :: [Edges a b] -> ShowS #

Serialize (Edges a b) # 
Instance details

Defined in Edges.Cereal.Instances

Methods

put :: Putter (Edges a b) #

get :: Get (Edges a b) #

list :: [(Node a, Node b)] -> Edges a b Source #

listBipartite :: [(Node a, Node b)] -> (Edges a b, Edges b a) Source #

primListBipartite :: [(Int, Int)] -> (Edges a b, Edges b a) Source #

toAssocUnfoldM :: Monad m => Edges a b -> UnfoldM m (Node a, Node b) Source #

toAssocList :: Edges a b -> [(Node a, Node b)] Source #

Orphan instances

Eq (Edges a b) Source # 
Instance details

Methods

(==) :: Edges a b -> Edges a b -> Bool #

(/=) :: Edges a b -> Edges a b -> Bool #

Show (Edges a b) Source # 
Instance details

Methods

showsPrec :: Int -> Edges a b -> ShowS #

show :: Edges a b -> String #

showList :: [Edges a b] -> ShowS #