Struct rugraph::Graph

pub struct Graph<T> where
    T: Ord + Clone + Display + Debug,  { /* fields omitted */ }

Graph is actually a generic directed graph where each node of type T must implement: T: Ord + Clone + std::fmt::Display + std::fmt::Debug

Implementations

impl<T> Graph<T> where
    T: Ord + Clone + Display + Debug, 

pub fn new() -> Self

pub fn add_node(&mut self, elem: T)

Adds a new node elem to the graph

pub fn add_edge(&mut self, from: T, to: T)

Creates a new edge from node from to node to nodes from and to must be previously added to the graph

pub fn get_neighbors(&self, from: T) -> Vec<T>

Returns a vector containing the neighbors of node from

pub fn is_connected(&self, from: T, to: T) -> bool

Returns if a node from is connected to a node to

pub fn is_directly_connected(&self, from: T, to: T) -> bool

Returns if node to is a neighbord of from

pub fn all_simple_paths(&self, from: T, to: T) -> Vec<Vec<T>>

Returns a Vec<Vec<T>> containing all the simple paths from node from to node to

pub fn to_dot(&self, file: &mut File, graph_name: &String)

Exports the graph to a dot file. file must be a valid file ready to be written. graph_name is the name of the graph

Trait Implementations

impl<T> Drop for Graph<T> where
    T: Ord + Clone + Display + Debug, 

fn drop(&mut self)

Executes the destructor for this type.