oxihuman-core 0.1.2

Core data structures, algorithms, and asset management for OxiHuman
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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141

// Copyright (C) 2026 COOLJAPAN OU (Team KitaSan)
// SPDX-License-Identifier: Apache-2.0
#![allow(dead_code)]

#[allow(dead_code)]
pub struct Graph {
    pub adjacency: Vec<Vec<usize>>,
    pub n_vertices: usize,
}

#[allow(dead_code)]
pub fn new_graph(n: usize) -> Graph {
    Graph { adjacency: vec![Vec::new(); n], n_vertices: n }
}

#[allow(dead_code)]
pub fn graph_add_edge(g: &mut Graph, u: usize, v: usize) {
    if u < g.n_vertices && v < g.n_vertices {
        if !g.adjacency[u].contains(&v) {
            g.adjacency[u].push(v);
        }
        if !g.adjacency[v].contains(&u) {
            g.adjacency[v].push(u);
        }
    }
}

#[allow(dead_code)]
pub fn graph_neighbors(g: &Graph, u: usize) -> &[usize] {
    if u < g.n_vertices { &g.adjacency[u] } else { &[] }
}

#[allow(dead_code)]
pub fn graph_vertex_count(g: &Graph) -> usize {
    g.n_vertices
}

#[allow(dead_code)]
pub fn graph_edge_count(g: &Graph) -> usize {
    let total: usize = g.adjacency.iter().map(|v| v.len()).sum();
    total / 2
}

#[allow(dead_code)]
pub fn graph_has_edge(g: &Graph, u: usize, v: usize) -> bool {
    if u < g.n_vertices {
        g.adjacency[u].contains(&v)
    } else {
        false
    }
}

#[allow(dead_code)]
pub fn graph_bfs_reachable(g: &Graph, start: usize) -> Vec<usize> {
    if start >= g.n_vertices {
        return Vec::new();
    }
    let mut visited = vec![false; g.n_vertices];
    let mut queue = std::collections::VecDeque::new();
    let mut result = Vec::new();
    visited[start] = true;
    queue.push_back(start);
    while let Some(node) = queue.pop_front() {
        result.push(node);
        for &neighbor in &g.adjacency[node] {
            if !visited[neighbor] {
                visited[neighbor] = true;
                queue.push_back(neighbor);
            }
        }
    }
    result
}

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

    #[test]
    fn test_vertex_count() {
        let g = new_graph(5);
        assert_eq!(graph_vertex_count(&g), 5);
    }

    #[test]
    fn test_add_edge() {
        let mut g = new_graph(4);
        graph_add_edge(&mut g, 0, 1);
        assert!(graph_has_edge(&g, 0, 1));
        assert!(graph_has_edge(&g, 1, 0)); /* undirected */
    }

    #[test]
    fn test_edge_count() {
        let mut g = new_graph(4);
        graph_add_edge(&mut g, 0, 1);
        graph_add_edge(&mut g, 1, 2);
        assert_eq!(graph_edge_count(&g), 2);
    }

    #[test]
    fn test_has_edge_false() {
        let g = new_graph(3);
        assert!(!graph_has_edge(&g, 0, 2));
    }

    #[test]
    fn test_neighbors() {
        let mut g = new_graph(3);
        graph_add_edge(&mut g, 0, 1);
        graph_add_edge(&mut g, 0, 2);
        let neighbors = graph_neighbors(&g, 0);
        assert_eq!(neighbors.len(), 2);
    }

    #[test]
    fn test_bfs_reachable_full() {
        let mut g = new_graph(4);
        graph_add_edge(&mut g, 0, 1);
        graph_add_edge(&mut g, 1, 2);
        graph_add_edge(&mut g, 2, 3);
        let reachable = graph_bfs_reachable(&g, 0);
        assert_eq!(reachable.len(), 4);
    }

    #[test]
    fn test_bfs_reachable_disconnected() {
        let mut g = new_graph(4);
        graph_add_edge(&mut g, 0, 1);
        let reachable = graph_bfs_reachable(&g, 0);
        assert_eq!(reachable.len(), 2);
    }

    #[test]
    fn test_no_duplicate_edges() {
        let mut g = new_graph(3);
        graph_add_edge(&mut g, 0, 1);
        graph_add_edge(&mut g, 0, 1);
        assert_eq!(graph_edge_count(&g), 1);
    }
}