Struct CscSnapshotGraph 

pub struct CscSnapshotGraph<'view, N = u32, E = u32>(/* private fields */)
where
    N: CsrSnapshotIndex,
    E: CsrSnapshotIndex;

Borrowed inbound adjacency (transpose-CSR / CSC layout).

N is the node index width and E is the edge index width; both default to u32 for the common engine configuration.

Performance

Per-node predecessor enumeration is O(k) for k incoming edges.

Implementations

impl<'view, N, E> CscSnapshotGraph<'view, N, E>

where N: CsrSnapshotIndex, E: CsrSnapshotIndex,

pub fn from_snapshot_with_kinds( snapshot: &Snapshot<'view>, offsets_kind: u32, targets_kind: u32, version: u32, ) -> Result<CscSnapshotGraph<'view, N, E>, CscSnapshotError<N, E>>

Opens inbound sections using explicit snapshot section kinds.

Reuses CsrGraph::from_snapshot_with_kinds over the transposed-edge layout, so callers select whichever band their storage layer reserves for the inbound index. CSC owns no section-kind constants.

Errors

Returns CscSnapshotError when sections are missing, have the wrong version, or fail validation.

Performance

This function is O(s + n + m).

pub const fn inner( &self, ) -> &CsrGraph<'view, N, E, <E as SnapshotWidth>::LittleEndianWord, <N as SnapshotWidth>::LittleEndianWord>

Returns the inner CSR graph backing this inbound view.

pub fn node_count(&self) -> usize

Returns the number of nodes in this inbound view.

Performance

This method is O(1).

pub fn relation_count(&self) -> usize

Returns the number of edges in this inbound view.

Performance

This method is O(1).

pub fn predecessors( &self, target: LocalId<NodeAxis, N>, ) -> impl ExactSizeIterator

Returns an iterator over predecessor node ids for target.

Performance

This method is O(1) to create and O(k) to yield k predecessors.

pub fn for_each_predecessor( &self, target: LocalId<NodeAxis, N>, visit: impl FnMut(LocalId<NodeAxis, N>) -> bool, ) -> bool

Walks predecessor node ids for target via the CSC source slice.

Stops early when visit returns true.

Performance

This method is O(k) for k predecessors with no iterator adapters.

Trait Implementations

impl<'view, N, E> Clone for CscSnapshotGraph<'view, N, E>

where N: Clone + CsrSnapshotIndex, E: Clone + CsrSnapshotIndex,

fn clone(&self) -> CscSnapshotGraph<'view, N, E>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<N, E> Debug for CscSnapshotGraph<'_, N, E>

where N: CsrSnapshotIndex, E: CsrSnapshotIndex,

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

Formats the value using the given formatter.

impl<N, E> ElementPredecessors for CscSnapshotGraph<'_, N, E>

where N: CsrSnapshotIndex, E: CsrSnapshotIndex,

type Predecessors<'view> = CscPredecessors<'view, N, E> where CscSnapshotGraph<'_, N, E>: 'view

Iterator over predecessor element IDs reaching one element.

fn element_predecessors( &self, element: LocalId<NodeAxis, N>, ) -> <CscSnapshotGraph<'_, N, E> as ElementPredecessors>::Predecessors<'_>

Returns elements that reach element through outgoing connections.

impl<N, E> TopologyBase for CscSnapshotGraph<'_, N, E>

where N: CsrSnapshotIndex, E: CsrSnapshotIndex,

type ElementId = LocalId<NodeAxis, N>

Identity of a topology element.

type RelationId = LocalId<EdgeAxis, E>

Identity of a topology relation.

impl<N, E> TopologyCounts for CscSnapshotGraph<'_, N, E>

where N: CsrSnapshotIndex, E: CsrSnapshotIndex,

fn element_count(&self) -> usize

Returns the number of elements visible in this topology view.

fn relation_count(&self) -> usize

Returns the number of relations visible in this topology view.

impl<'view, N, E> Copy for CscSnapshotGraph<'view, N, E>

where N: Copy + CsrSnapshotIndex, E: Copy + CsrSnapshotIndex,