| Overview | Group | Tree | Graph | Index | Concepts |
Given an activity act on a schedule with a schedule precedence graph,
several useful sets of activities can be defined with respect to act
(set of successors of act,
set of predecessors of act, etc.).
The enumeration IlcActivityIteratorFilter can be used to create an activity
iterator IlcActivityIterator that allows traversing
such sets of activities.
Each element of the enumeration specifies a particular set to traverse.
IlcPredecessors specifies that the iterator traverse the set of activities that are
predecessors of a given activity.
IlcSuccessors specifies that the iterator traverse the set of activities that are
successors of a given activity.
IlcDirectPredecessors specifies that the iterator traverse the set of activities
that are direct predecessors of a given activity.
IlcDirectSuccessors specifies that the iterator traverse the set of activities that
are direct successors of a given activity.
IlcUnranked specifies that the iterator traverse the set of activities that are
unranked with respect to a given activity.
For more information, see Precedence Graph Constraints.
See Also:
| Fields |
|---|
IlcPredecessors = 6 | |
IlcSuccessors = 7 | |
IlcDirectPredecessors = 3 | |
IlcDirectSuccessors = 4 | |
IlcUnranked = 5 |