Struct CsrQueueGraphLayout 

pub struct CsrQueueGraphLayout {
    pub node_count: u32,
    pub edge_count: u32,
    pub max_row_degree: u32,
    pub words: usize,
    pub edge_storage_words: usize,
}

Validated resident graph layout for queue-driven sparse traversal.

The primitive owns these derived counts so resident dispatch wrappers do not fork CSR edge-count, edge-padding, or frontier bitset sizing rules.

Fields

node_count: u32

Number of graph nodes accepted by the primitive.

edge_count: u32

Exact physical edge count declared by edge_offsets[node_count].

max_row_degree: u32

Largest CSR row degree in the graph.

words: usize

Number of u32 words in each packed frontier bitset.

edge_storage_words: usize

Number of u32 words to allocate/upload for edge target and kind arrays.

Trait Implementations

impl Clone for CsrQueueGraphLayout

fn clone(&self) -> CsrQueueGraphLayout

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for CsrQueueGraphLayout

impl Debug for CsrQueueGraphLayout

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

Formats the value using the given formatter.

impl Eq for CsrQueueGraphLayout

impl PartialEq for CsrQueueGraphLayout

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for CsrQueueGraphLayout