|
|
|
|
|
Description |
Generating and drawing graphs of FSMs.
Includes:
|
|
Synopsis |
|
|
|
|
FGL graph operations.
|
|
|
When converting an FSM into a graph, do we keep
all self-loops, or only those which are sources of nondeterminism?
| Constructors | |
|
|
|
Turn an FSM into an fgl graph with labelled edges.
|
|
|
Compute an FSM's strongly-connected components.
|
|
|
Compute an FSM's weakly-connected components.
|
|
Dot and GML format output.
|
|
|
Subclass Show so that show calls on Strings and Chars
don't get quotes inserted.
| | Instances | |
|
|
|
Turn an FSM into a DotGraph, trimming any
self-loops which aren't sources of nondeterminism.
|
|
|
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 |