harmony-0.1.1.0: A web service specification compiler that generates implementation and tests.

Safe HaskellSafe-Inferred
LanguageHaskell2010

Data.DiGraph

Documentation

data Ord a => Graph a Source

Instances

Ord a => Eq (Graph a) 
(Ord a, Show a) => Show (Graph a) 

empty :: Ord a => Graph a Source

create :: Ord a => [(a, [a])] -> Graph a Source

addNode :: Ord a => a -> Graph a -> Graph a Source

addAllNodes :: Ord a => [a] -> Graph a -> Graph a Source

addNeighbors :: Ord a => a -> [a] -> Graph a -> Graph a Source

addAllNeighbors :: Ord a => [(a, [a])] -> Graph a -> Graph a Source

contains :: Ord a => Graph a -> a -> Bool Source

deleteNode :: Ord a => a -> Graph a -> Graph a Source

getNeighbors :: Ord a => Graph a -> a -> Maybe [a] Source

getNodes :: Ord a => Graph a -> [a] Source

isEmpty :: Ord a => Graph a -> Bool Source

hasCycle :: Ord a => Graph a -> Bool Source

generateInverseDependencyList :: Ord a => Graph a -> [a] Source