| OperationGraph manages a list of PartialOrderNodes
and pairwise preferences between them.
The getOrderedOperationList method performs a topological sort.
The topological sort follows the algorithm described in Horowitz
and Sahni, Fundamentals of Data Structures (1976), p. 315.
Several minor changes are made to their implementation. First,
nodes are represented as objects, not as integers. The count
(in-degree) field is not used to link zero in-degree objects, but
instead a separate zeroLink field is used. The neighbor lists are
stored as Vectors, not linked lists, and enumerations are used
to iterate over them.
This class is used by the implementation of the OperationRegistry
class and is not intended to be part of the API.
- what was OperationGraph pre-JAI 1.1 is now FactoryOperationGraph
|
