Struct SimpleGraph 

pub struct SimpleGraph { /* private fields */ }

Simple directed graph.

Implementations

impl SimpleGraph

pub fn new() -> Self

pub fn add_node(&mut self, id: u32, label: &str)

pub fn remove_node(&mut self, id: u32) -> bool

pub fn add_edge(&mut self, from: u32, to: u32, label: &str, weight: f32)

pub fn node_count(&self) -> usize

pub fn edge_count(&self) -> usize

pub fn has_node(&self, id: u32) -> bool

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

pub fn in_neighbors(&self, id: u32) -> Vec<u32>

pub fn bfs(&self, start: u32) -> Vec<u32>

BFS reachability from start.

pub fn has_path(&self, from: u32, to: u32) -> bool

Check whether there is a path from from to to.

pub fn node_label(&self, id: u32) -> Option<&str>

pub fn is_empty(&self) -> bool

pub fn clear(&mut self)

Trait Implementations

impl Default for SimpleGraph

fn default() -> Self

Returns the “default value” for a type.