graph-core-0.1.0.0: Fast, memory efficient and persistent graph implementation

Safe Haskell	None

Data.Graph

Documentation

data Graph Source

Instances

Eq Graph
Show Graph
Arbitrary Graph
NFData Graph

type Node = Int Source

type NodeSet = IntSet Source

data Edge Source

Constructors

Edge
Fields src :: !Node tgt :: !Node

Instances

Eq Edge
Ord Edge
Show Edge
Hashable Edge
SafeCopy Edge

empty :: Graph Source

fromEdges :: [Edge] -> Graph Source

fromAdj :: [(Node, [Node])] -> Graph Source

isConsistent :: Graph -> Bool Source

nodes :: Graph -> [Node]Source

edges :: Graph -> [Edge]Source

children :: Graph -> Node -> Vector Node Source

parents :: Graph -> Node -> Vector Node Source

hasEdge :: Node -> Node -> Graph -> Bool Source

edgeCount :: Graph -> Int Source

hull :: Graph -> Node -> NodeSet Source

rhull :: Graph -> Node -> NodeSet Source

hullFold :: Graph -> (b -> Node -> b) -> b -> Node -> bSource

hullFoldM :: Monad m => Graph -> (b -> Node -> m b) -> b -> Node -> m bSource

rhullFold :: Graph -> (b -> Node -> b) -> b -> Node -> bSource

addEdge :: Node -> Node -> Graph -> Graph Source

addEdges :: [Edge] -> Graph -> Graph Source

removeEdge :: Node -> Node -> Graph -> Graph Source

removeEdges :: [Edge] -> Graph -> Graph Source

addNode :: Node -> Graph -> Graph Source

solitaireNodes :: Graph -> [Node]Source

edgesAdj :: AdjList -> [Edge]Source