Struct TopologicalGenerationsTrace 

pub struct TopologicalGenerationsTrace {
    pub generations: Vec<Vec<(usize, Option<usize>)>>,
    pub unprocessed: Vec<usize>,
    pub in_degree: Vec<usize>,
    pub scanned: Vec<(usize, usize)>,
    pub gen_offsets: Vec<usize>,
}

Kahn’s generations as far as they go, with what networkx’s lazy topological_generations loop holds at every generation boundary.

networkx processes generation k (decrementing its children’s in-degree on the LIVE graph) just before yielding it. A caller that mutates the graph between two yields makes networkx continue from its state at that boundary: in_degree minus every decrement in scanned[..gen_offsets[k]], with generation k as the zero-in-degree list. Indices are positions in DiGraph::nodes_ordered().

Fields

generations: Vec<Vec<(usize, Option<usize>)>>

Per generation: (node, zeroing parent), in networkx’s order.

unprocessed: Vec<usize>

Nodes whose in-degree never reached zero (on or behind a cycle), in node order. Empty exactly when the graph is acyclic.

in_degree: Vec<usize>

Each node’s in-degree before any processing.

scanned: Vec<(usize, usize)>

(parent, child) of every successor edge scanned, in scan order.

gen_offsets: Vec<usize>

gen_offsets[k] is scanned.len() when processing generation k began.

Trait Implementations

impl Clone for TopologicalGenerationsTrace

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for TopologicalGenerationsTrace

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

Formats the value using the given formatter.

impl Eq for TopologicalGenerationsTrace

impl PartialEq for TopologicalGenerationsTrace

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for TopologicalGenerationsTrace