algae-graph 0.1.19

Algae is a collection of core algorithms and data-structures, written in Rust
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
52
53
54
55
56
57
58

/*
    Appellation: edge <module>
    Contrib: FL03 <jo3mccain@icloud.com>
    Description: an edge consists of two nodes and an optional edge value
*/
use super::Pair;
use crate::Node;
use serde::{Deserialize, Serialize};

pub trait Related<N: Node, V> {}

#[derive(Clone, Debug, Default, Deserialize, Eq, Hash, Ord, PartialEq, PartialOrd, Serialize)]
pub struct Edge<N = String, V = i64>
where
    N: Node,
{
    pair: Pair<N>,
    weight: V,
}

impl<N, V> Edge<N, V>
where
    N: Node,
{
    pub fn new(a: N, b: N, weight: V) -> Self {
        Self {
            pair: Pair::new(a, b),
            weight,
        }
    }
    pub fn pair(&self) -> Pair<N> {
        self.pair.clone()
    }
    pub fn value(&self) -> &V {
        &self.weight
    }
}

impl<N, V> From<(N, N, V)> for Edge<N, V>
where
    N: Node,
{
    fn from(data: (N, N, V)) -> Self {
        Self::new(data.0, data.1, data.2)
    }
}

impl<N, V> From<(Pair<N>, V)> for Edge<N, V>
where
    N: Node,
{
    fn from(data: (Pair<N>, V)) -> Self {
        Self {
            pair: data.0,
            weight: data.1,
        }
    }
}