Parameters stemming from graph usage

Each graph tested or manipulated by a rule must be passed as parameter of the generated routine. However, the user need not provide declarations for these; automatically generates a correct parameter list. The graph parameter list is ordered alphabetically.

The user has to take care that these parameter graphs are prepared correctly:

• all graphs must be created by a create-function of the functor library
• graphs must have nodes (and edges if they are not empty). The nodes must have been added to the graph by calling addnode-functions of the graph functors, single edges may be added by addedge-functions. Then more edges are calculated and inserted by the generated routine.

• if predicates are stated over the same variable, the universes of the corresponding graphs must be the same (equality on graph node domains). Otherwise unexpected results can occur.