|
Data.Graph.Analysis.Types | |
|
|
|
|
Description |
This module defines the various types and classes utilised
by the Graphalyze library.
|
|
Synopsis |
|
|
|
|
Graph specialization
|
|
|
By default, the Graphalyze library works on graphs with no edge labels.
As such, these types provide useful aliases for the default FGL types.
Most of the algorithms, however, work on arbitrary graph types.
Represents information about the graph being analysed.
| Constructors | GraphData | | graph :: AGr a | We use a graph type with no edge labels.
| wantedRoots :: LNGroup a | The expected roots in the graph.
|
|
| Instances | |
|
|
|
We use a basic tree-based graph by default.
|
|
|
A grouping of Nodes.
|
|
|
A grouping of LNodes.
|
|
Graph Label classes
|
|
class Ord c => ClusterLabel a c | a -> c where | Source |
|
These types and classes represent useful label types.
The class of outputs of a clustering algorithm.
This class is mainly used for visualization purposes,
with the Ord instance required for grouping.
Instances of this class are intended for use as
the label type of graphs.
| | Methods | | The cluster the node label belongs in.
| | | The printed form of the actual label.
|
| | Instances | |
|
|
|
A generic cluster-label type.
| Constructors | | Instances | |
|
|
|
Label type for storing node positions. Note that this isn't an instance of
ClusterLabel since there's no clear indication on which cluster a node
belongs to at this stage.
| Constructors | | Instances | |
|
|
Produced by Haddock version 2.3.0 |