Struct Csr 

pub struct Csr<Index: Idx, NI, EV> { /* private fields */ }

A Compressed-Sparse-Row data structure to represent sparse graphs.

The data structure is composed of two arrays: offsets and targets. For a graph with node count n and edge count m, offsets has exactly n + 1 and targets exactly m entries.

For a given node u, offsets[u] stores the start index of the neighbor list of u in targets. The degree of u, i.e., the length of the neighbor list is defined by offsets[u + 1] - offsets[u]. The neighbor list of u is defined by the slice &targets[offsets[u]..offsets[u + 1]].

Trait Implementations

impl<Index: Debug + Idx, NI: Debug, EV: Debug> Debug for Csr<Index, NI, EV>

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

Formats the value using the given formatter.

impl<NI, EV, E> From<(&E, NI, Direction, CsrLayout)> for Csr<NI, NI, EV>

where NI: Idx, EV: Copy + Send + Sync, E: Edges<NI = NI, EV = EV>,

fn from( (edge_list, node_count, direction, csr_layout): (&E, NI, Direction, CsrLayout), ) -> Self

Converts to this type from the input type.

impl<NI: Idx, EV> From<Csr<NI, NI, EV>> for UndirectedCsrGraph<NI, (), EV>

fn from(csr: Csr<NI, NI, EV>) -> Self

Converts to this type from the input type.