fsmActions-0.2.0: Finite state machines and FSM actions Source code Contents Index

Data.FsmActions.FGL

Description

Interface to fgl graph library (http://hackage.haskell.org/package/fgl).

Synopsis

data SelfLoops = Keep | Trim fsmToFGL :: FSM sy -> SelfLoops -> Gr () sy strongCCs :: Eq sy => FSM sy -> [[State]] weakCCs :: Eq sy => FSM sy -> [[State]]

Documentation

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 () sy Source

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.

Produced by Haddock version 2.4.2