hypergraph 2.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

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

impl<V, HE> Hypergraph<V, HE>
where
    V: VertexTrait,
    HE: HyperedgeTrait,
{
    // This private method is infallible since adding the same hyperedge
    // will return the existing index.
    pub(crate) fn add_hyperedge_index(&mut self, internal_index: usize) -> HyperedgeIndex {
        if let Some(hyperedge_index) = self.hyperedges_mapping.left.get(&internal_index) {
            *hyperedge_index
        } else {
            let hyperedge_index = HyperedgeIndex(self.hyperedges_count);

            if self
                .hyperedges_mapping
                .left
                .insert(internal_index, hyperedge_index)
                .is_none()
            {
                // Update the counter only for the first insertion.
                self.hyperedges_count += 1;
            }

            self.hyperedges_mapping
                .right
                .insert(hyperedge_index, internal_index);

            hyperedge_index
        }
    }
}