simplegraph 0.2.2

A simple graph implementation
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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64

/***
 * Ciao
 */

macro_rules! enum_mut {
    ($list:expr) => {
        $list.iter_mut().enumerate()
    };
}

pub mod adjacency_list_graph;
pub mod dot;
pub mod graph;
pub mod math_graph;
pub mod matrix_graph;
pub mod path_cost;
mod update_nodes;
pub mod visitor;

use serde::{Deserialize, Serialize};

pub use adjacency_list_graph::AdjList;
pub use graph::Graph;
pub use matrix_graph::MatrixGraph;
pub use visitor::GraphVisitor;

/**
 * Specify, for a graph, if it is direct or not.  
 */
#[derive(Clone, Copy, Deserialize, Serialize, PartialEq, Debug)]
pub enum GraphType {
    Direct,
    Undirect,
}

/**
 * Return the graph's type
 */
pub trait GetGraphType {
    fn graph_type(&self) -> GraphType;
}

fn empty_list_of_lists<T>(count: usize) -> Vec<Vec<T>> {
    (0..count).map(|_| vec![]).collect()
}


#[cfg(test)]
mod tests {
    pub fn euclid_distance(p1: &(f64, f64), p2: &(f64, f64)) -> f64 {
        let (x1, y1) = p1;
        let (x2, y2) = p2;
        let dx = x1 - x2;
        let dy = y1 - y2;
        ((dx * dx) + (dy * dy)).sqrt()
    }

    pub fn approx_equal(a: f64, b: f64, tol: f64) {
        let diff = (a - b).abs();
        assert!(diff <= tol, "a: {a}, b: {b}, tol: {tol}");
    }
}