2 unstable releases
| new 0.2.0 | May 27, 2024 |
|---|---|
| 0.1.0 | Feb 19, 2023 |
#16 in #directed-acyclic-graph
62 downloads per month
Used in 3 crates
(via git-branchless-test)
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.8–2.6MB
~48K SLoC