hypergraph 4.1.0

Hypergraph is data structure library to create a directed hypergraph in which an hyperedge can join any number of vertices.
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

use crate::{
    HyperedgeTrait,
    Hypergraph,
    VertexTrait,
    errors::HypergraphError,
};

impl<V, HE> Hypergraph<V, HE>
where
    V: VertexTrait,
    HE: HyperedgeTrait,
{
    /// Removes all hyperedges from the hypergraph.
    ///
    /// Vertices are retained with their weights, but their hyperedge
    /// back-reference sets are cleared. Always returns `Ok(())`.
    pub fn clear_hyperedges(&mut self) -> Result<(), HypergraphError<V, HE>> {
        self.hyperedges.clear();
        self.hyperedges_count = 0;

        for (_, he_set) in self.vertices.values_mut() {
            he_set.clear();
        }

        Ok(())
    }
}

#[cfg(test)]
mod tests {
    use crate::core::test_support::build;

    #[test]
    fn clears_all_hyperedges_keeps_vertices() {
        let (mut g, _, _) = build();
        g.clear_hyperedges().unwrap();
        assert_eq!(g.count_hyperedges(), 0);
        assert_eq!(g.count_vertices(), 4);
    }
}