fsmActions-0.3.0: Finite state machines and FSM actionsSource codeContentsIndex
Data.FsmActions.Graph
Contents
FGL graph operations.
Dot and GML format output.
Description

Generating and drawing graphs of FSMs.

Includes:

Synopsis
data SelfLoops
= Keep
| Trim
fsmToFGL :: FSM sy -> SelfLoops -> Gr () sy
strongCCs :: Eq sy => FSM sy -> [[State]]
weakCCs :: Eq sy => FSM sy -> [[State]]
class Show a => CleanShow a
fsmToDot :: (Ord sy, CleanShow sy) => FSM sy -> DotGraph
fsmToGML :: CleanShow sy => FSM sy -> Doc
FGL graph operations.
data SelfLoops Source
When converting an FSM into a graph, do we keep all self-loops, or only those which are sources of nondeterminism?
Constructors
Keep
Trim
fsmToFGL :: FSM sy -> SelfLoops -> Gr () sySource
Turn an FSM into an fgl graph with labelled edges.
strongCCs :: Eq sy => FSM sy -> [[State]]Source
Compute an FSM's strongly-connected components.
weakCCs :: Eq sy => FSM sy -> [[State]]Source
Compute an FSM's weakly-connected components.
Dot and GML format output.
class Show a => CleanShow a Source
Subclass Show so that show calls on Strings and Chars don't get quotes inserted.
show/hide Instances
fsmToDot :: (Ord sy, CleanShow sy) => FSM sy -> DotGraphSource
Turn an FSM into a DotGraph, trimming any self-loops which aren't sources of nondeterminism.
fsmToGML :: CleanShow sy => FSM sy -> DocSource
Turn an FSM into a GML-formatted graph', trimming any self-loops which aren't sources of nondeterminism.
Produced by Haddock version 2.4.2