All about Generators
A generator is an algorithm that decides
how to traverse a model. Different generators will generate different
test sequences, and they will navigate in different ways.
RANDOM
Navigate through the model in a completly random manor. Also called "Drunkard’s walk", or "Random walk".
SHORTEST
Tries to calculate the shortest path through a model.
LIST
Generates a list of all edges and
vertices in a graph. If the label of a vertex or an edge occurs more
than once in the model, it will only be printed once.
See also How to list all unique labels in a graph.
STUB
Generates source code, with the use of templates.
See also How to generate source code from a model.
REQUIREMENTS
Generates a list of all requirements found in a model.
See also How to generate list of requirements from a model.