3 releases (breaking)

0.3.0 Oct 14, 2024
0.2.0 May 27, 2024
0.1.0 Feb 19, 2023

#1023 in Algorithms

40 downloads per month
Used in 3 crates (via git-branchless-test)

MIT/Apache

43KB
901 lines

scm-bisect

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.

License: MIT.


lib.rs:

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.

Dependencies

~1.7–2.5MB
~45K SLoC