Hakyll.Core.DirectedGraph

Representation of a directed graph. In Hakyll, this is used for dependency tracking.

Documentation

data DirectedGraph a

Type used to represent a directed graph

Instances

Typeable1 DirectedGraph

Show a => Show (DirectedGraph a)

Ord a => Monoid (DirectedGraph a)

Allow users to concatenate different graphs

(Ord a, Binary a) => Binary (DirectedGraph a)

fromList

Arguments

:: Ord a

=> [(a, Set a)]

List of (node, reachable neighbours)

-> DirectedGraph a

Resulting directed graph

Construction of directed graphs

toList :: DirectedGraph a -> [(a, Set a)]

Deconstruction of directed graphs

member

Arguments

:: Ord a

=> a

Node to check for

-> DirectedGraph a

Directed graph to check in

-> Bool

If the node lies in the graph

Check if a node lies in the given graph

nodes

Arguments

:: Ord a

=> DirectedGraph a

Graph to get the nodes from

-> Set a

All nodes in the graph

Get all nodes in the graph

neighbours

Arguments

:: Ord a

=> a

Node to get the neighbours of

-> DirectedGraph a

Graph to search in

-> Set a

Set containing the neighbours

Get a set of reachable neighbours from a directed graph

reverse :: Ord a => DirectedGraph a -> DirectedGraph a

Reverse a directed graph (i.e. flip all edges)

reachableNodes :: Ord a => Set a -> DirectedGraph a -> Set a

Find all reachable nodes from a given set of nodes in the directed graph

sanitize :: Ord a => DirectedGraph a -> DirectedGraph a

Remove all dangling pointers, i.e. references to notes that do not actually exist in the graph.