edges-0.4.1: Tools for efficient immutable graphs
Edges.Edges
Contents
data Edges source target Source #
Defined in Edges.Edges
Methods
(==) :: Edges a b -> Edges a b -> Bool #
(/=) :: Edges a b -> Edges a b -> Bool #
showsPrec :: Int -> Edges a b -> ShowS #
show :: Edges a b -> String #
showList :: [Edges a b] -> ShowS #
Defined in Edges.Cereal.Instances
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 #
genBipartiteWithLimits :: Int -> Int -> Gen (Edges a b, Edges b a) Source #