An encapsulated strategy consisting of a strategy graph S, sets of source and target nodes s and t (subsets of nodes in S), a name relation N from nodes in S to symbolic names (strings), and a constraint map B from edges in S to predicates over symbolic elements.
For a list of all members of this type, see ISimpleStrategy Members.
Namespace: edu.neu.ccs.demeter.APRlib
Assembly: APRlib (in APRlib.dll)
ISimpleStrategy Members | edu.neu.ccs.demeter.APRlib Namespace