Struct Graph 

pub struct Graph { /* private fields */ }

A directed or undirected graph using adjacency list representation.

Storage Layout

• Nodes stored in vec for O(1) access and cache locality
• Edges stored as Vec<Vec> for adjacency list
• Optional weights stored in separate hash maps to minimize memory when unweighted

Implementations

impl Graph

pub fn new(num_nodes: u32, is_directed: bool) -> Self

Creates a new empty graph with capacity for num_nodes nodes.

pub fn num_nodes(&self) -> u32

Returns the number of nodes in the graph.

pub fn num_edges(&self) -> u32

Returns the number of edges in the graph.

pub fn is_directed(&self) -> bool

Returns whether the graph is directed.

pub fn add_edge(&mut self, from: NodeId, to: NodeId, weight: Option<EdgeWeight>)

Adds an edge from from to to with optional weight.

For undirected graphs, this automatically adds the reverse edge.

Panics

Panics if from or to are >= num_nodes.

pub fn neighbors(&self, node: NodeId) -> &[NodeId]

Gets the neighbors (outgoing edges) for a node.

pub fn edge_weight(&self, from: NodeId, to: NodeId) -> Option<EdgeWeight>

Gets the weight of an edge.

pub fn set_node_weights(&mut self, weights: Vec<NodeWeight>)

Sets weights for all nodes.

pub fn node_weight(&self, node: NodeId) -> Option<NodeWeight>

Gets the weight of a node.

pub fn nodes(&self) -> impl Iterator<Item = NodeId>

Iterates over all nodes in the graph.

pub fn edges(&self) -> impl Iterator<Item = (NodeId, NodeId)> + '_

Iterates over all edges in the graph as (from, to) tuples.

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Graph

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Graph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for Graph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.