graph-base 0.1.14

A Rust library for graph data structures and algorithms
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


use crate::{generator::{RandomExpand, RandomGenerate}, interfaces::{edge::{NodeSet}, graph::{SingleId}, hypergraph::{Hypergraph}}};

// impl<V> RandomGenerate for V 
// where V: Vertex {
//     fn random_generate(n: usize, _e: usize, rng: &mut impl rand::Rng) -> Self {
//         let id = rng.gen_range(0..n);
//         Self::new(id)
//     }
// }

pub trait NodeSample<'a>: Hypergraph<'a> {
    fn sample(&self, rng: &mut impl rand::Rng) -> Vec<&Self::Node>;
}

impl<'a, H> RandomGenerate for H 
where H: NodeSample<'a>, H::Node: RandomGenerate + SingleId, H::Edge: NodeSet {
    fn random_generate(n: usize, e: usize, rng: &mut impl rand::Rng) -> Self {
        let mut hypergraph = Self::new();
        for i in 0..n {
            let new_node = H::Node::random_generate(i, e, rng);
            hypergraph.add_node(new_node);
        }
        for _ in 0..e {
            let nodes = hypergraph.sample(rng);
            let nodes = nodes.iter().map(|node| node.id()).collect::<Vec<_>>();
            let new_edge = H::Edge::from_nodes(nodes);
            hypergraph.add_hyperedge(new_edge);
        }
        hypergraph
    }
}

impl<'a, H> RandomExpand for H 
where H: NodeSample<'a> + Clone, H::Node: RandomGenerate + SingleId, H::Edge: NodeSet {
    fn random_expand(&self, n_plus: usize, e_plus: usize, rng: &mut impl rand::Rng) -> Self {
        let mut hypergraph = self.clone();
        for _ in 0..n_plus {
            let new_node = H::Node::random_generate(n_plus, e_plus, rng);
            hypergraph.add_node(new_node);
        }
        for _ in 0..e_plus {
            let nodes = hypergraph.sample(rng);
            let nodes = nodes.iter().map(|node| node.id()).collect::<Vec<_>>();
            let new_edge = H::Edge::from_nodes(nodes);
            hypergraph.add_hyperedge(new_edge);
        }
        hypergraph
    }
}