Struct Graph 

pub struct Graph { /* private fields */ }

Directed multigraph over typed nodes.

Invariants, enforced at construction:

• node ids are unique and case-sensitive; a collision is an error
• every edge endpoint refers to an existing node
• every node has a non-empty id, name, and file, and a span with end > start

Parallel edges that differ in relation or confidence coexist; exact duplicate edges deduplicate silently.

Implementations

impl Graph

pub fn new() -> Self

pub fn add_node(&mut self, node: Node) -> Result<(), GraphError>

pub fn add_edge(&mut self, edge: Edge) -> Result<(), GraphError>

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

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

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

pub fn edges_from<'a>( &'a self, id: &'a NodeId, ) -> impl Iterator<Item = &'a Edge>

pub fn edges_to<'a>(&'a self, id: &'a NodeId) -> impl Iterator<Item = &'a Edge>

pub fn node_count(&self) -> usize

pub fn edge_count(&self) -> usize

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 Default for Graph

fn default() -> Graph

Returns the “default value” for a type.

impl Eq for Graph

impl PartialEq for Graph

fn eq(&self, other: &Graph) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Graph