Haskus.Utils.STM.TGraph

Transactionnal graph

Documentation

deepFirst :: (Monad m, Ord a) => (a -> m ()) -> (a -> m ()) -> (a -> m [a]) -> [a] -> m ()

Deep-first graph traversal

before is executed when the node is entered after is executed when the node is leaved children gets node's children

breadthFirst :: (Monad m, Ord a) => (a -> m Bool) -> (a -> m [a]) -> [a] -> m ()

Breadth-first graph traversal

visit is executed when the node is entered. If False is returned, the traversal ends children gets node's children

data TNode a r

A node contains a value and two lists of incoming/outgoing edges

Constructors

TNode

Fields

• nodeValue :: a
• nodeEdgeIn :: TList (r, TNode a r)
• nodeEdgeOut :: TList (r, TNode a r)

singleton :: a -> STM (TNode a r)

Create a graph node

linkTo :: TNode a r -> r -> TNode a r -> STM ()

Link two nodes together