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





Description 
This is the root module of the Graphalyze library, which aims to
provide a way of analysing the relationships inherent in discrete
data as a graph.
This was written as part of my mathematics honours thesis,
GraphTheoretic Analysis of the Relationships in Discrete Data.


Synopsis 



Documentation 


The library version.


Reexporting other modules


module Data.Graph.Analysis.Types 

module Data.Graph.Analysis.Utils 

module Data.Graph.Analysis.Algorithms 

module Data.Graph.Analysis.Reporting 

Importing data



This represents the information that's being passed in that we want
to analyse. If the graph is undirected, it is better to list each
edge once rather than both directions.
 Constructors  Params   dataPoints :: [a]  The discrete points.
 relationships :: [(a, a)]  The relationships between the points.
 roots :: [a]  The expected roots of the graph.
If directed = False, then this is ignored.
 directed :: Bool  False if relationships are symmetric
(i.e. an undirected graph).






Default values for ImportParams, with no roots and a directed graph.



Import data into a format suitable for analysis. This function is
edgesafe: if any datums are listed in the edges of
ImportParams that aren't listed in the data points, then those
edges are ignored. Thus, no sanitation of the relationships in
ImportParams is necessary.


Result analysis


Extra functions for data analysis.



Returns the mean and standard deviations of the lengths of the sublists,
as well all those lists more than one standard deviation longer than
the mean.



Compare the actual roots in the graph with those that are expected
(i.e. those in wantedRoots). Returns (in order):
 Those roots that are expected (i.e. elements of wantedRoots
that are roots).
 Those roots that are expected but not present (i.e. elements of
wantedRoots that aren't roots.
 Unexpected roots (i.e. those roots that aren't present in
wantedRoots).


Produced by Haddock version 2.1.0 