Struct DynamicTopo 

pub struct DynamicTopo<N: Copy + Eq + Hash + Ord> { /* private fields */ }

DynamicTopo maintains a deterministic total order (pos) consistent with the conceptual DAG.

Implementations

impl<N> DynamicTopo<N>

where N: Copy + Eq + Hash + Ord,

pub fn new(nodes: impl IntoIterator<Item = N>, cfg: PkConfig) -> Self

pub fn rebuild_full<G: GraphView<N>>(&mut self, graph: &G)

Full rebuild via Kahn-style topological sort. Breaks ties by node Ord.

pub fn try_add_edge<G: GraphView<N>>( &mut self, graph: &G, x: N, y: N, ) -> Result<PkStats, Cycle<N>>

pub fn remove_edge(&mut self, _x: N, _y: N)

pub fn apply_bulk<G: GraphView<N>>( &mut self, graph: &G, removes: &[(N, N)], adds: &[(N, N)], ) -> Result<PkStats, Cycle<N>>

pub fn topo_order(&self) -> &[N]

pub fn compact_ranks(&mut self)

pub fn layers_for<G: GraphView<N>>( &self, graph: &G, subset: &[N], max_layer_width: Option<usize>, ) -> Vec<Vec<N>>

Build parallel-ready layers for a subset, using maintained order for tie-breaks.

pub fn ensure_nodes(&mut self, nodes: impl IntoIterator<Item = N>)

Ensure that all provided nodes exist in the ordering; append any missing at the end.

Trait Implementations

impl<N: Debug + Copy + Eq + Hash + Ord> Debug for DynamicTopo<N>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.