Struct Graph 

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

Graph representation

Fields

nodes: HashMap<String, GraphNode>

Nodes in the graph.

edges: Vec<GraphEdge>

Edges in the graph.

directed: bool

Whether the graph is directed.

Implementations

impl Graph

pub fn new(directed: bool) -> Self

Creates a new Graph.

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

Adds a node to the graph.

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

Adds an edge to the graph.

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

Gets the neighbors of a node.

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

Gets the degree of a node.

pub fn is_connected(&self) -> bool

Checks if the graph is connected.

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

Finds all cycles in the 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 Visualize for Graph

fn visualize(&self) -> Result<String>

Visualize the object as an SVG string