
Data.Graph.Analysis.Algorithms.Directed  Maintainer  Ivan.Miljenovic@gmail.com 





Description 
Defines algorithms that work on both directed graphs.


Synopsis 




Ending nodes


Find starting/ending nodes.
We define an ending node as one where, given a function:
f :: (Graph g) => g a b > Node > [Node]
the only allowed result is that node itself (to allow for loops).



Determine if this LNode is an ending node.



Determine if this Node is an ending node.



Find all LNodes that meet the ending criteria.



Find all Nodes that match the ending criteria.


Root nodes



Find all roots of the graph.



Find all roots of the graph.



Returns True if this LNode is a root.



Returns True if this Node is a root.


Leaf nodes



Find all leaves of the graph.



Find all leaves of the graph.



Returns True if this LNode is a leaf.



Returns True if this Node is a leaf.


Singleton nodes



Find all singletons of the graph.



Find all singletons of the graph.



Returns True if this LNode is a singleton.



Returns True if this Node is a singleton.


Subgraphs



The core of the graph is the part of the graph containing all the
cycles, etc. Depending on the context, it could be interpreted as
the part of the graph where all the work is done.


Produced by Haddock version 2.3.0 