Struct Graph 

pub struct Graph {
    pub nodes: HashMap<String, GraphNode>,
    pub edges: Vec<GraphEdge>,
    pub directed: bool,
}

Graph representation

Fields

nodes: HashMap<String, GraphNode>

edges: Vec<GraphEdge>

directed: bool

Implementations

impl Graph

pub fn new(directed: bool) -> Self

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

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

pub fn get_neighbors(&self, node_id: &str) -> Vec<&str>

pub fn get_degree(&self, node_id: &str) -> usize

pub fn is_connected(&self) -> bool

pub fn find_cycles(&self) -> Vec<Vec<String>>

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.