Crate scm_bisect

source ·
Expand description

Reusable algorithms for identifying the first bad commit in a directed acyclic graph (similar to git-bisect). The intention is to provide support for various source control systems.


  • Basic search strategies; see BasicStrategyKind.
  • A search algorithm for directed acyclic graphs to find the nodes which “flip” from passing to failing a predicate.