Struct Graph 

pub struct Graph { /* private fields */ }

Implementations

impl Graph

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

pub fn add_edge(&mut self, edge: Edge)

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

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

pub fn node_count(&self) -> usize

pub fn edge_count(&self) -> usize

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

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

pub fn neighbors(&self, id: &str) -> Vec<NodeId>

Undirected neighbors: every node reachable by one edge, either direction.

pub fn degree(&self, id: &str) -> usize

pub fn upsert_node(&mut self, n: Node)

Insert or replace a node by id.

pub fn upsert_edge(&mut self, e: Edge)

Insert or replace an edge by id. Replacing an edge whose endpoints changed unlinks the OLD endpoints first — otherwise the id would linger in adjacency lists it no longer belongs to and be missing from the ones it does, so degree()/most_central() would disagree with edges.

pub fn most_central(&self) -> Option<NodeId>

The highest-degree node, ties broken by smallest id (deterministic). None for an empty graph.

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.