geometric-traits 0.1.0

Trait-based algebraic and graph algorithms for Rust, supporting no_std environments
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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129

//! Submodule providing a naively implemented `GenericBiGraph`.

#[cfg(feature = "mem_dbg")]
use alloc::{string::String, vec::Vec};

use num_traits::AsPrimitive;

use super::generic_monoplex_bipartite_graph_builder::MonoplexBipartiteGraphBuilderError;
use crate::traits::{
    BidirectionalVocabulary, BipartiteGraph, Edges, Graph, MonoplexGraph, PositiveInteger,
    TryFromUsize, Vocabulary,
};

#[cfg_attr(feature = "mem_size", derive(mem_dbg::MemSize))]
#[cfg_attr(feature = "mem_size", mem_size(rec))]
#[cfg_attr(feature = "mem_dbg", derive(mem_dbg::MemDbg))]
#[derive(Clone, PartialEq, Eq, Hash)]
/// Struct representing a generic bigraph.
pub struct GenericBiGraph<LeftNodes, RightNodes, Edges> {
    /// The left nodes of the graph.
    left_nodes: LeftNodes,
    /// The right nodes of the graph.
    right_nodes: RightNodes,
    /// The edges of the graph.
    edges: Edges,
}

impl<LeftNodes, RightNodes, Edges> core::fmt::Debug for GenericBiGraph<LeftNodes, RightNodes, Edges>
where
    LeftNodes: core::fmt::Debug,
    RightNodes: core::fmt::Debug,
    Edges: core::fmt::Debug,
{
    #[inline]
    fn fmt(&self, f: &mut core::fmt::Formatter<'_>) -> core::fmt::Result {
        f.debug_struct("GenericBiGraph")
            .field("left_nodes", &self.left_nodes)
            .field("right_nodes", &self.right_nodes)
            .field("edges", &self.edges)
            .finish()
    }
}

impl<LeftNodes, RightNodes, Edges> TryFrom<(LeftNodes, RightNodes, Edges)>
    for GenericBiGraph<LeftNodes, RightNodes, Edges>
{
    type Error = MonoplexBipartiteGraphBuilderError;

    #[inline]
    fn try_from(
        (left_nodes, right_nodes, edges): (LeftNodes, RightNodes, Edges),
    ) -> Result<Self, Self::Error> {
        Ok(Self { left_nodes, right_nodes, edges })
    }
}

impl<LeftNodes, RightNodes, Edges> Default for GenericBiGraph<LeftNodes, RightNodes, Edges>
where
    LeftNodes: Default,
    RightNodes: Default,
    Edges: Default,
{
    #[inline]
    fn default() -> Self {
        Self {
            left_nodes: LeftNodes::default(),
            right_nodes: RightNodes::default(),
            edges: Edges::default(),
        }
    }
}

impl<LeftNodes, RightNodes, E> Graph for GenericBiGraph<LeftNodes, RightNodes, E>
where
    LeftNodes: Vocabulary,
    RightNodes: Vocabulary,
    E: Edges<SourceNodeId = LeftNodes::SourceSymbol, DestinationNodeId = RightNodes::SourceSymbol>,
{
    #[inline]
    fn has_edges(&self) -> bool {
        self.edges.has_edges()
    }

    #[inline]
    fn has_nodes(&self) -> bool {
        !self.left_nodes.is_empty() && !self.right_nodes.is_empty()
    }
}

impl<LeftNodes, RightNodes, E> BipartiteGraph for GenericBiGraph<LeftNodes, RightNodes, E>
where
    LeftNodes: Vocabulary + BidirectionalVocabulary,
    RightNodes: Vocabulary + BidirectionalVocabulary,
    LeftNodes::SourceSymbol: PositiveInteger + AsPrimitive<usize> + TryFromUsize,
    RightNodes::SourceSymbol: PositiveInteger + AsPrimitive<usize> + TryFromUsize,
    E: Edges<SourceNodeId = LeftNodes::SourceSymbol, DestinationNodeId = RightNodes::SourceSymbol>,
{
    type LeftNodeId = LeftNodes::SourceSymbol;
    type RightNodeId = RightNodes::SourceSymbol;
    type LeftNodeSymbol = LeftNodes::DestinationSymbol;
    type RightNodeSymbol = RightNodes::DestinationSymbol;
    type LeftNodes = LeftNodes;
    type RightNodes = RightNodes;

    #[inline]
    fn left_nodes_vocabulary(&self) -> &Self::LeftNodes {
        &self.left_nodes
    }

    #[inline]
    fn right_nodes_vocabulary(&self) -> &Self::RightNodes {
        &self.right_nodes
    }
}

impl<LeftNodes, RightNodes, E> MonoplexGraph for GenericBiGraph<LeftNodes, RightNodes, E>
where
    E: Edges<SourceNodeId = LeftNodes::SourceSymbol, DestinationNodeId = RightNodes::SourceSymbol>,
    LeftNodes: Vocabulary,
    RightNodes: Vocabulary,
{
    type Edge = E::Edge;
    type Edges = E;

    #[inline]
    fn edges(&self) -> &Self::Edges {
        &self.edges
    }
}