Struct MultiGraph

pub struct MultiGraph<N: Node, E: EdgeWeight, Ix: IndexType = u32> { /* private fields */ }

A multi-graph structure that supports parallel edges

Unlike Graph, MultiGraph allows multiple edges between the same pair of nodes. This is useful for modeling scenarios where multiple connections of different types or weights can exist between nodes.

Implementations

impl<N: Node, E: EdgeWeight, Ix: IndexType> MultiGraph<N, E, Ix>

pub fn new() -> Self

Create a new empty multi-graph

pub fn add_node(&mut self, node: N)

Add a node to the graph

pub fn add_edge(&mut self, source: N, target: N, weight: E) -> usize

where N: Clone, E: Clone,

Add an edge between two nodes with a given weight Returns the edge ID for reference

pub fn get_edges_between(&self, source: &N, target: &N) -> Vec<(usize, &E)>

where E: Clone,

Get all parallel edges between two nodes

pub fn remove_edge(&mut self, edge_id: usize) -> Result<Edge<N, E>>

where N: Clone, E: Clone,

Remove an edge by its ID

pub fn nodes(&self) -> Iter<'_, N>

Get all nodes in the graph

pub fn edges(&self) -> Values<'_, usize, Edge<N, E>>

Get all edges in the graph

pub fn node_count(&self) -> usize

Number of nodes in the graph

pub fn edge_count(&self) -> usize

Number of edges in the graph

pub fn neighbors_with_edges(&self, node: &N) -> Option<&Vec<(N, E, usize)>>

Get neighbors of a node with edge weights and IDs

pub fn neighbors(&self, node: &N) -> Vec<&N>

Get simple neighbors (without edge information)

pub fn has_node(&self, node: &N) -> bool

Check if the graph contains a node

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

Get the degree of a node (total number of incident edges)

Trait Implementations

impl<N: Node, E: EdgeWeight, Ix: IndexType> Default for MultiGraph<N, E, Ix>

fn default() -> Self

Returns the “default value” for a type.