kipedia.org/wiki/Topological_sorting">topological sorting for acyclic graphs. The algorithm complexity is
O(m+n), where
m is count of vertices and
n is count of edges. However this complexity isn't true for this algorithm implementation because there's backward compatibility requirement that deployers have to be ordered by their relative number or name if they're on the same processing level.
IOW this backward compatible sorting requirement violates algorithm linear complexity, see:
JBDEPLOY-233.
@author
Richard Opalka