cluster_linearize::DepGraph::DepGraph

Synopses

Declared in <cluster_linearize.h>

Construct an empty graph.

DepGraph() noexcept = default;

Copy-construct a graph.

DepGraph(DepGraph const& other) noexcept = default;

Move-construct a graph.

DepGraph(DepGraph&& other) noexcept = default;

Construct a DepGraph object given another DepGraph and a mapping from old to new.

DepGraph(
    DepGraph<SetType> const& depgraph,
    std::span<DepGraphIndex const> mapping,
    DepGraphIndex pos_range) noexcept;

Name	Description
other	The graph to copy from.
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.