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.
Modules§
- basic
- Example implementations of basic search strategies as defined in
search. SeeBasicStrategyKindfor the list. - search
- A search algorithm for directed acyclic graphs to find the nodes which “flip” from passing to failing a predicate.