Range declarations on automatically generated parameters

It is also possible to save the writing of parameters and let infer them. Then a range declaration must give a hint of which type the node must be taken. Currently there are the following possibilities:

• specify a graph name which is used in the rules as predicate.
  Then the order loop range is initialized to the node domain of that (tested or modified) graph. Also that graph is inserted automatically in the parameter list of the generated routine.

  If the modifier .TARGET is specified, the target node domain (domain 2) of a bipartite graph functor is taken, otherwise the source domain (domain 1).

• sets.
  If the range is declared to be an application of a set functor, a set parameter is inserted automatically in the parameter list of the generated routine. This set is then taken to initialize the order loop node.
• single source path problem (SSPP) initialization.
  The range of an order loop node can also be only one single parameter object. Then the rule which contains the order loop node is considered to be an SSPP rule with a single source node and a result solution set which contains all nodes that fulfil the SSPP problem (section 3.8.3). The result set is thus the second part of the declaration. Source node of the SSPP as well as the result set are inserted automatically as parameters of the generated routine.
• single parameters.
  Then the order loop domain is just a variable, which is included automatically in the parameter list of the generated routine.