摘要 |
A method for making an infeasible sequence of things feasible. The method includes generating a series of matrices that define the relative position of the things in the sequence based on graph theory, and multiplying the matrices to determine the required order of the things in the sequence based on prior pre-determined constraints. The method selects a current position for each thing in the sequence, and looks at each thing before the current position of a thing on a sequential basis to determine whether the thing at the current position should come before any of the previous things based on the multiplied matrices. The method also looks at other constraints, including determining if any of the things must follow each other in the sequence, determining whether any of the things in the sequence cannot follow one after the other, etc.
|