Struct GraphIndex 

pub struct GraphIndex { /* private fields */ }

Dense, reusable indexes over a Graph.

This is backend-neutral: it validates edge endpoints, maps node ids to stable vertex indexes, and stores edge adjacency by both node id and vertex index. Higher-level crates can use it for local analytics or query planning without rebuilding the same maps.

Implementations

impl GraphIndex

pub fn new(graph: &Graph) -> Result<Self>

pub fn vertex_index(&self, id: &NodeId) -> Option<usize>

pub fn require_vertex_index(&self, id: &NodeId) -> Result<usize>

pub fn outgoing_edges(&self, id: &NodeId) -> &[usize]

pub fn incoming_edges(&self, id: &NodeId) -> &[usize]

pub fn outgoing_by_vertex(&self, index: usize) -> &[usize]

pub fn incoming_by_vertex(&self, index: usize) -> &[usize]

pub fn edge_endpoints(&self, edge_index: usize) -> (usize, usize)

pub fn edge_endpoints_slice(&self) -> &[(usize, usize)]

pub fn out_degree(&self, index: usize) -> usize

pub fn in_degree(&self, index: usize) -> usize

pub fn degree(&self, index: usize) -> usize

Trait Implementations

impl Clone for GraphIndex

fn clone(&self) -> GraphIndex

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphIndex

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

Formats the value using the given formatter.

impl PartialEq for GraphIndex

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for GraphIndex