algograph 0.4.0

A (both directed and undirected) graph and their algorithms implemented in Rust
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31

//! Implementations of low-level undirected graph

mod tree_backed;
pub use self::tree_backed::*;
mod adjacent_list;
pub use self::adjacent_list::*;

#[cfg(test)]
mod tests {
    use crate::graph::*;

    #[test]
    fn to_graphviz() {
        let mut g = undirected::AdjacentListGraph::new();
        let v = g.add_vertex();
        g.add_edge(v, v);
        let trial = {
            let mut trial = vec![];
            g.dump_in_graphviz(&mut trial, "trial").unwrap();
            String::from_utf8(trial).unwrap()
        };
        assert_eq!(
            trial,
            r#"graph trial {
  0 ;
  0 -- 0 ;
}
"#
        );
    }
}