Struct MultiDiGraph

pub struct MultiDiGraph<T, E>
where
    T: Ord + Clone + Display + Debug,
    E: Ord + Clone + Display + Debug,
{ /* private fields */ }

MultiDiGraph is actually a generic multi directed graph where each node of type T and edge of type E must implement: T: Ord + Clone + std::fmt::Display + std::fmt::Debug and E: Ord + Clone + std::fmt::Display + std::fmt::Debug

Implementations

impl<T, E> MultiDiGraph<T, E>

where T: Ord + Clone + Display + Debug, E: Ord + Clone + Display + Debug,

pub fn new() -> Self

Examples found in repository

examples/example2.rs (line 11)

fn main() {
    println!("Example of dot file creation. Check example2.dot file.\nTo create a picture install graphivz.\n\n$ dot -Tpng example2.dot -o example2.png\n\n");

    let mut fd = File::create("example2.dot").expect("error creating file");
    let mut graph = MultiDiGraph::<String, String>::new();
    graph.add_node("a".to_string());
    graph.add_node("b".to_string());
    graph.add_node("c".to_string());
    graph.add_node("d".to_string());
    graph.add_edge("a".to_string(), "b".to_string(), "ab".to_string());
    graph.add_edge("b".to_string(), "c".to_string(), "bc".to_string());
    graph.add_edge("c".to_string(), "d".to_string(), "cd".to_string());
    graph.add_edge("a".to_string(), "d".to_string(), "ad".to_string());
    graph.to_dot_file(&mut fd, &String::from("to_dot_multidigraph_test"));
    let s = graph.to_dot_string(&String::from("to_dot_multidigraph_test"));
    println!("File content:\n{}", s);
}

Trait Implementations

impl<T, E> Drop for MultiDiGraph<T, E>

where T: Ord + Clone + Display + Debug, E: Ord + Clone + Display + Debug,

fn drop(&mut self)

Executes the destructor for this type.

impl<T, E> IGraph<T> for MultiDiGraph<T, E>

where T: Ord + Clone + Display + Debug, E: Ord + Clone + Display + Debug,

fn add_node(&mut self, elem: T)

Adds a new node elem to the graph

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

Returns if node to is a neighbord of from

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

Returns if a node from is connected to a node to

fn to_dot_file(&self, file: &mut File, graph_name: &str)

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

fn to_dot_string(&self, graph_name: &str) -> String

Returns an String with a dot file representation of the graph

fn node_exists(&self, from: T) -> bool

Returns true if node node exists

fn is_empty(&self) -> bool

Returns if a graph doesn’t contain nodes

fn count_nodes(&self) -> usize

Returns how many nodes are in the graph

fn get_nodes(&self) -> Vec<T>

Returns a vector of the elements

impl<T, E> IMultiDiGraph<T, E> for MultiDiGraph<T, E>

where T: Ord + Clone + Display + Debug, E: Ord + Clone + Display + Debug,

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

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

fn is_directly_connected_by(&self, from: T, to: T, edge: E) -> bool

Returns if node to is a neighbord of from by edge edge

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

Returns a vector Vec<Vec<(T, T, E)>> containing all the simple paths from node from to node to in a vector of tuples (from,to,edge)

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

Returns a vector containing the neighbors of node from