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

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

impl<V, HE> Hypergraph<V, HE>
where
    V: VertexTrait,
    HE: HyperedgeTrait,
{
    /// Returns the stable indexes of all hyperedges whose weight equals `weight`.
    ///
    /// Multiple hyperedges may share the same weight, so a `Vec` is returned.
    /// Returns an empty `Vec` if no match is found.
    #[must_use]
    pub fn find_hyperedges_by_weight(&self, weight: HE) -> Vec<HyperedgeIndex> {
        self.hyperedges_iter()
            .filter_map(|(idx, w)| (*w == weight).then_some(idx))
            .collect()
    }
}