Struct Graph 

pub struct Graph<N, W> { /* private fields */ }

A graph data structure supporting both directed and undirected graphs

Type parameters:

• N: Node data type
• W: Edge weight type

Implementations

impl<N, W> Graph<N, W>

where N: Clone + Debug, W: Clone + Debug,

pub fn new(graph_type: GraphType) -> Self

Creates a new empty graph

pub fn graph_type(&self) -> GraphType

Returns the type of the graph

pub fn node_count(&self) -> usize

Returns the number of nodes in the graph

pub fn edge_count(&self) -> usize

Returns the number of edges in the graph

pub fn is_empty(&self) -> bool

Checks if the graph is empty

pub fn add_node(&mut self, data: N) -> NodeId

Adds a node to the graph and returns its ID

pub fn remove_node(&mut self, node_id: NodeId) -> Result<N, GraphError>

Removes a node and all its connected edges from the graph

pub fn get_node(&self, node_id: NodeId) -> Option<&Node<N>>

Gets a reference to a node by ID

pub fn get_node_mut(&mut self, node_id: NodeId) -> Option<&mut Node<N>>

Gets a mutable reference to a node by ID

pub fn add_edge( &mut self, source: NodeId, target: NodeId, weight: Option<W>, ) -> Result<EdgeId, GraphError>

Adds an edge between two nodes

pub fn remove_edge(&mut self, edge_id: EdgeId) -> Result<Edge<W>, GraphError>

Removes an edge from the graph

pub fn get_edge(&self, edge_id: EdgeId) -> Option<&Edge<W>>

Gets a reference to an edge by ID

pub fn get_edge_mut(&mut self, edge_id: EdgeId) -> Option<&mut Edge<W>>

Gets a mutable reference to an edge by ID

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

Returns an iterator over all nodes

pub fn edges(&self) -> impl Iterator<Item = (&EdgeId, &Edge<W>)>

Returns an iterator over all edges

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

Returns an iterator over all node IDs

pub fn edge_ids(&self) -> impl Iterator<Item = EdgeId> + '_

Returns an iterator over all edge IDs

pub fn neighbors(&self, node_id: NodeId) -> Option<Vec<NodeId>>

Returns the neighbors of a node (outgoing edges for directed graphs)

pub fn predecessors(&self, node_id: NodeId) -> Option<Vec<NodeId>>

Returns the predecessors of a node (incoming edges for directed graphs)

pub fn edges_of(&self, node_id: NodeId) -> Option<Vec<EdgeId>>

Returns the edges connected to a node

pub fn has_edge(&self, source: NodeId, target: NodeId) -> bool

Checks if an edge exists between two nodes

pub fn get_edge_between( &self, source: NodeId, target: NodeId, ) -> Option<&Edge<W>>

Gets the edge between two nodes if it exists

pub fn degree(&self, node_id: NodeId) -> Option<usize>

Returns the degree of a node

pub fn in_degree(&self, node_id: NodeId) -> Option<usize>

Returns the in-degree of a node (for directed graphs)

pub fn out_degree(&self, node_id: NodeId) -> Option<usize>

Returns the out-degree of a node (for directed graphs)

pub fn subgraph(&self, node_ids: &[NodeId]) -> Graph<N, W>

Creates a subgraph containing only the specified nodes and their connecting edges

pub fn reverse(&self) -> Graph<N, W>

Returns a reversed version of the graph (only meaningful for directed graphs)

pub fn to_undirected(&self) -> Graph<N, W>

Converts a directed graph to an undirected graph

pub fn clear(&mut self)

Clears all nodes and edges from the graph

Trait Implementations

impl<N: Clone, W: Clone> Clone for Graph<N, W>

fn clone(&self) -> Graph<N, W>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<N: Debug, W: Debug> Debug for Graph<N, W>

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

Formats the value using the given formatter.

impl<N, W> Default for Graph<N, W>

where N: Clone + Debug, W: Clone + Debug,

fn default() -> Self

Returns the “default value” for a type.