An algorithm for generating combinatorial structures is said to be an orderly algorithm if it produces precisely one representative of each isomorphism class. In this paper we describe a way to construct an orderly algorithm that is suitable for several common searching tasks in combinatorics. We illustrate this with examples of searches in finite geometry, and an extended application where we classify all the maximal partial flocks of the hyperbolic and elliptic quadrics in PG(3, q) for q≤13. © 1998 Elsevier Science B.V. All rights reserved.
Royle, G. F. (1998). An orderly algorithm and some applications in finite geometry. Discrete Mathematics, 185(1–3), 105–115. https://doi.org/10.1016/S0012-365X(97)00167-2