Code history has the structure of a directed acyclic graph which can be topologically sorted.
For code bisection it is desirable that each revision in the search space can be built and tested independently.