Construct a spanning forest for the given DepGraph, with every transaction in its own chunk (not topological).
Declared in <cluster_linearize.h>
explicit
SpanningForestState(
DepGraph<SetType> const& depgraph,
uint64_t rng_seed,
CostModel const& cost = CostModel{}) noexcept;
| Name | Description |
|---|---|
| depgraph | The dependency graph to linearize (must outlive this state). |
| rng_seed | Seed for the internal random number generator. |
| cost | The cost model used to account for algorithm work. |