Struct GraphSimpleDirectedEdgeTopology 

pub struct GraphSimpleDirectedEdgeTopology { /* private fields */ }

Footer-proven topology needed to skip Python-compatible edge normalization.

This is deliberately a narrow source contract. It does not cover graph algorithms or their workspace. It proves only that filtering null endpoints and deduplicating a directed edge list are semantic no-ops for these two physical Parquet columns.

Implementations

impl GraphSimpleDirectedEdgeTopology

pub const fn new( source_column_index: usize, destination_column_index: usize, ) -> Option<Self>

Creates a simple-directed topology proof for two distinct endpoint columns.

Trait Implementations

impl Clone for GraphSimpleDirectedEdgeTopology

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for GraphSimpleDirectedEdgeTopology

impl Debug for GraphSimpleDirectedEdgeTopology

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

Formats the value using the given formatter.

impl Eq for GraphSimpleDirectedEdgeTopology

impl PartialEq for GraphSimpleDirectedEdgeTopology

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for GraphSimpleDirectedEdgeTopology