Data.FsmActions.Graph

Generating, interpreting, and drawing graphs of FSMs.

Includes:

• Interface to fgl graph library for graph input/output (http://hackage.haskell.org/package/fgl).
• Interface to graphviz library for dot output (http://hackage.haskell.org/package/graphviz).
• Home-grown GML (Graph Modelling Language) output.

FGL graph operations.

data SelfLoops

When converting an FSM into a graph, do we keep all self-loops, or only those which are sources of nondeterminism?

Constructors

Keep

Keep them all

Trim

Trim any which aren't nondeterminism sources.

fsmToFGL :: FSM sy -> SelfLoops -> Gr () sy

Turn an FSM into an fgl graph with labelled edges.

fglDot :: (Ord b, CleanShow b, Graph gr) => gr a b -> DotGraph Int

strongCCs :: Eq sy => FSM sy -> [[State]]

Compute an FSM's strongly-connected components.

weakCCs :: Eq sy => FSM sy -> [[State]]

Compute an FSM's weakly-connected components.

Dot and GML format output.

class Show a => CleanShow a where

Subclass Show so that show calls on Strings and Chars don't get quotes inserted.

Methods

cleanShow :: a -> String

Instances

CleanShow Char

CleanShow String

CleanShow ()

Show a => CleanShow a

fsmToDot :: (Ord sy, CleanShow sy) => FSM sy -> DotGraph Int

Turn an FSM into a DotGraph, trimming any self-loops which aren't sources of nondeterminism.

fsmToGML :: CleanShow sy => FSM sy -> Doc

Turn an FSM into a GML-formatted graph', trimming any self-loops which aren't sources of nondeterminism.

Input.

fglToFsm :: (Graph gr, Ord sy, Show sy) => gr a sy -> ReadFsmMonad (FSM sy, [LNode a])

Turn an FGL graph (interpreted as being a directed graph) into an FSM. Self-loops are inserted as required. Also returns a list of the graph's labelled nodes, since the labels are discarded by the FSM construction. FSM states are numbered [0..] and thus may be used as an index into that list of labelled nodes, in order to relate FSM states back to the original graph nodes and their labels.