Construct a DepGraph object given another DepGraph and a mapping from old to new.
Declared in <cluster_linearize.h>
DepGraph(
DepGraph<SetType> const& depgraph,
std::span<DepGraphIndex const> mapping,
DepGraphIndex pos_range) noexcept;Complexity: O(N^2) where N=depgraph.TxCount().
| Name | Description |
|---|---|
| depgraph | The original DepGraph that is being remapped. |
| mapping | A span such that mapping[i]gives the position in the new DepGraph for position i in the old depgraph. Its size must be equal to depgraph.PositionRange(). The value of mapping[i]is ignored if position i is a hole in depgraph (i.e., if !depgraph.Positions()[i]). |
| pos_range | The PositionRange() for the new DepGraph. It must equal the largest value in mapping for any used position in depgraph plus 1, or 0 if depgraph.TxCount() == 0. |