hypergraph 4.2.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
41

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

impl<V, HE> Hypergraph<V, HE>
where
    V: VertexTrait,
    HE: HyperedgeTrait,
{
    /// Returns `true` if at least one vertex with the given weight exists.
    #[must_use]
    pub fn contains_vertex(&self, weight: V) -> bool {
        self.vertices.values().any(|(w, _)| *w == weight)
    }
}

#[cfg(test)]
mod tests {
    use crate::{
        Hypergraph,
        core::test_support::{
            E,
            W,
        },
    };

    #[test]
    fn finds_existing() {
        let mut g: Hypergraph<W, E> = Hypergraph::new();
        g.add_vertex(W(3)).unwrap();
        assert!(g.contains_vertex(W(3)));
    }

    #[test]
    fn returns_false_for_missing() {
        let g: Hypergraph<W, E> = Hypergraph::new();
        assert!(!g.contains_vertex(W(99)));
    }
}