ade-graph-generators 0.1.0

Functions for generating various types of graph data, including complete and random graphs.
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

pub fn complete_graph_data(n: usize) -> (Vec<u32>, Vec<(u32, u32)>) {
    let nodes: Vec<u32> = (0..n as u32).collect();

    let mut edges = Vec::new();
    for &src in &nodes {
        for &dst in &nodes {
            if src != dst {
                edges.push((src, dst));
            }
        }
    }

    (nodes, edges)
}

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

    #[test]
    fn test_complete_graph_data() {
        let (nodes, edges) = complete_graph_data(3);
        assert_eq!(nodes.len(), 3);
        assert_eq!(edges.len(), 3 * 2);

        let (nodes, edges) = complete_graph_data(4);
        assert_eq!(nodes.len(), 4);
        assert_eq!(edges.len(), 4 * 3);

        let (nodes, edges) = complete_graph_data(7);
        assert_eq!(nodes.len(), 7);
        assert_eq!(edges.len(), 7 * 6);
    }
}