jj/lib
Yuya Nishihara 5cecdb54ce dag_walk: add lazy topo-order iterator for chronological data
The idea is that the DAG can be split at single fork point while walking
chronologically, and run DFS-based topological sort for each sub graph.
This works well for operation log.

We could also build a topo-sort stack while splitting, but we couldn't detect
cycles in that way. It would also be quite expensive on pessimistic cases.
2023-06-11 11:38:03 +09:00
..
benches
gen-protos
src dag_walk: add lazy topo-order iterator for chronological data 2023-06-11 11:38:03 +09:00
tests
testutils cargo: bump tempfile from 3.5.0 to 3.6.0 2023-06-08 22:53:55 -07:00
build.rs
Cargo.toml cargo: bump tempfile from 3.5.0 to 3.6.0 2023-06-08 22:53:55 -07:00