Struct NodeGraph 

pub struct NodeGraph<N, E> { /* private fields */ }

Pure node graph data model with typed ports.

Implementations

impl<N, E> NodeGraph<N, E>

pub fn new() -> Self

Creates an empty graph.

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

Adds a node without ports and returns its identifier.

pub fn add_node_with_ports(&mut self, payload: N, ports: Vec<Port>) -> NodeId

Adds a node with declared ports and returns its identifier.

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

Removes a node and all connected edges.

pub fn add_edge( &mut self, from: (NodeId, PortId), to: (NodeId, PortId), payload: E, ) -> Result<EdgeId, GraphError>

Adds a validated directed edge between two ports.

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

Removes an edge by identifier.

pub fn node(&self, id: NodeId) -> Option<&Node<N>>

Returns an immutable node reference.

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

Returns a mutable node reference.

pub fn edge(&self, id: EdgeId) -> Option<&Edge<E>>

Returns an immutable edge reference.

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

Iterates over nodes in identifier order.

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

Iterates over edges in identifier order.

pub fn connected(&self, port: (NodeId, PortId)) -> Vec<EdgeId>

Returns all edges connected to the given port.

pub fn incoming(&self, node: NodeId) -> Vec<EdgeId>

Returns all incoming edge identifiers for a node.

pub fn outgoing(&self, node: NodeId) -> Vec<EdgeId>

Returns all outgoing edge identifiers for a node.

Trait Implementations

impl<N: Clone, E: Clone> Clone for NodeGraph<N, E>

fn clone(&self) -> NodeGraph<N, E>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<N: Debug, E: Debug> Debug for NodeGraph<N, E>

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

Formats the value using the given formatter.

impl<N, E> Default for NodeGraph<N, E>

fn default() -> Self

Returns the “default value” for a type.

impl<N: PartialEq, E: PartialEq> PartialEq for NodeGraph<N, E>

fn eq(&self, other: &NodeGraph<N, E>) -> 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<N: Eq, E: Eq> Eq for NodeGraph<N, E>

impl<N, E> StructuralPartialEq for NodeGraph<N, E>