Struct SimpleGraph 

pub struct SimpleGraph { /* private fields */ }

Simple directed graph with adjacency lists.

Stores outgoing and incoming edge lists per vertex for O(degree) traversal, plus a direct Eid-to-edge map for O(1) edge lookup.

Implementations

impl SimpleGraph

pub fn new() -> SimpleGraph

Creates a new empty graph.

pub fn with_capacity(vertices: usize, edges: usize) -> SimpleGraph

Creates a new graph with pre-allocated capacity.

pub fn add_vertex(&mut self, vid: Vid) -> bool

Adds a vertex to the graph. Returns true if the vertex was newly added.

pub fn remove_vertex(&mut self, vid: Vid)

Removes a vertex and all its edges from the graph.

pub fn contains_vertex(&self, vid: Vid) -> bool

Checks if a vertex exists in the graph.

pub fn vertex_count(&self) -> usize

Returns the number of vertices in the graph.

pub fn add_edge(&mut self, src_vid: Vid, dst_vid: Vid, eid: Eid, edge_type: u32)

Adds an edge to the graph. Vertices are implicitly created if they don’t exist.

pub fn add_edge_unchecked( &mut self, src_vid: Vid, dst_vid: Vid, eid: Eid, edge_type: u32, )

Adds an edge without checking if vertices exist. Use when vertices are pre-added.

pub fn remove_edge(&mut self, eid: Eid) -> Option<EdgeEntry>

Removes an edge by its ID. Returns the removed edge entry if found.

Uses O(1) lookup via edge_map, then O(degree) removal from adjacency lists.

pub fn neighbors(&self, vid: Vid, direction: Direction) -> &[EdgeEntry]

Returns neighbors in the specified direction. O(degree) complexity.

pub fn edges(&self) -> impl Iterator<Item = &EdgeEntry>

Returns an iterator over all edges in the graph.

pub fn edge(&self, eid: Eid) -> Option<&EdgeEntry>

Returns the edge with the given Eid in O(1) time.

pub fn vertex(&self, vid: Vid) -> Option<Vid>

Checks if a vertex exists and returns it (identity).

pub fn edge_count(&self) -> usize

Returns the total number of edges in the graph.

pub fn vertices(&self) -> impl Iterator<Item = Vid>

Returns an iterator over all vertices in the graph.

pub fn clear(&mut self)

Clears the graph, removing all vertices and edges.

Trait Implementations

impl Debug for SimpleGraph

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

Formats the value using the given formatter.

impl Default for SimpleGraph

fn default() -> SimpleGraph

Returns the “default value” for a type.