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
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
//! Traits for monopartite undirected graphs.
//!
//! These graphs have the following properties:
//!
//! * All nodes are of the same type.
//! * All edges are bidirectional.
use super::{MonopartiteEdges, MonopartiteGraph, MonoplexMonopartiteGraph, TransposedEdges};
use crate::traits::{
SizedRowsSparseMatrix2D, SizedSparseBiMatrix2D, SparseMatrix2D, SparseSymmetricMatrix2D,
TransposedMonoplexGraph,
};
/// Trait defining the properties of a directed graph.
pub trait UndirectedMonopartiteEdges:
MonopartiteEdges<
MonopartiteMatrix = <Self as UndirectedMonopartiteEdges>::SymmetricSquaredMatrix,
> + TransposedEdges<BiMatrix = <Self as UndirectedMonopartiteEdges>::SymmetricSquaredMatrix>
{
/// Neighbors of a node.
type SymmetricSquaredMatrix: SparseSymmetricMatrix2D<Index = Self::NodeId>
+ SizedSparseBiMatrix2D;
/// Returns the neighbors of the node with the given identifier.
#[inline]
fn neighbors(
&self,
node: Self::NodeId,
) -> <Self::SymmetricSquaredMatrix as SparseMatrix2D>::SparseRow<'_> {
self.matrix().sparse_row(node)
}
/// Returns the degree of the node with the given identifier.
#[inline]
fn degree(&self, node: Self::NodeId) -> Self::NodeId {
debug_assert_eq!(
self.matrix().number_of_defined_values_in_row(node),
self.matrix().number_of_defined_values_in_column(node)
);
self.matrix().number_of_defined_values_in_row(node)
}
/// Returns the iterator over the degrees of the nodes in the graph.
#[inline]
fn degrees(
&self,
) -> <Self::SymmetricSquaredMatrix as SizedRowsSparseMatrix2D>::SparseRowSizes<'_> {
self.matrix().sparse_row_sizes()
}
}
impl<E> UndirectedMonopartiteEdges for E
where
E: TransposedEdges + MonopartiteEdges<MonopartiteMatrix = E::BiMatrix>,
E::BiMatrix: SparseSymmetricMatrix2D<Index = E::NodeId, SparseIndex = E::EdgeId>
+ SizedSparseBiMatrix2D<
SizedSparseMatrix = <E::BiMatrix as SparseSymmetricMatrix2D>::SymmetricSparseMatrix,
SizedSparseTransposedMatrix = <E::BiMatrix as SparseSymmetricMatrix2D>::SymmetricSparseMatrix,
>,
{
type SymmetricSquaredMatrix = E::BiMatrix;
}
/// Trait defining the properties of monopartite undirected graphs.
///
/// This trait combines `MonoplexMonopartiteGraph` and
/// `TransposedMonoplexGraph`, requiring that the edges are undirected
/// (symmetric).
pub trait UndirectedMonopartiteMonoplexGraph:
MonoplexMonopartiteGraph<MonoplexMonopartiteEdges = Self::UndirectedMonopartiteEdges>
+ TransposedMonoplexGraph<TransposedEdges = Self::UndirectedMonopartiteEdges>
{
/// The undirected edges of the graph, constrained to have matching node
/// identifiers.
type UndirectedMonopartiteEdges: UndirectedMonopartiteEdges<
NodeId = <Self as MonopartiteGraph>::NodeId,
>;
/// Returns the neighbors of the node with the given identifier.
///
/// # Examples
///
/// ```
/// # #[cfg(feature = "alloc")]
/// # {
/// use geometric_traits::{
/// impls::{CSR2D, SortedVec, SymmetricCSR2D, UpperTriangularCSR2D},
/// naive_structs::{GenericGraph, GenericUndirectedMonopartiteEdgesBuilder},
/// prelude::*,
/// traits::{EdgesBuilder, VocabularyBuilder},
/// };
///
/// let nodes: Vec<usize> = vec![0, 1, 2];
/// let edges: Vec<(usize, usize)> = vec![(0, 1), (1, 2)];
/// let nodes: SortedVec<usize> = GenericVocabularyBuilder::default()
/// .expected_number_of_symbols(nodes.len())
/// .symbols(nodes.into_iter().enumerate())
/// .build()
/// .unwrap();
/// let edges: SymmetricCSR2D<CSR2D<usize, usize, usize>> =
/// GenericUndirectedMonopartiteEdgesBuilder::<
/// _,
/// UpperTriangularCSR2D<CSR2D<usize, usize, usize>>,
/// SymmetricCSR2D<CSR2D<usize, usize, usize>>,
/// >::default()
/// .expected_number_of_edges(edges.len())
/// .expected_shape(nodes.len())
/// .edges(edges.into_iter())
/// .build()
/// .unwrap();
/// let graph: GenericGraph<SortedVec<usize>, SymmetricCSR2D<CSR2D<usize, usize, usize>>> =
/// GenericGraph::from((nodes, edges));
///
/// let neighbors: Vec<usize> = graph.neighbors(1).collect();
/// assert_eq!(neighbors, vec![0, 2]);
/// # }
/// ```
#[inline]
fn neighbors(
&self,
node: Self::NodeId,
) -> <<Self::UndirectedMonopartiteEdges as UndirectedMonopartiteEdges>::SymmetricSquaredMatrix as SparseMatrix2D>::SparseRow<'_>{
self.edges().neighbors(node)
}
/// Returns the degree of the node with the given identifier.
///
/// # Examples
///
/// ```
/// # #[cfg(feature = "alloc")]
/// # {
/// use geometric_traits::{
/// impls::{CSR2D, SortedVec, SymmetricCSR2D, UpperTriangularCSR2D},
/// naive_structs::{GenericGraph, GenericUndirectedMonopartiteEdgesBuilder},
/// prelude::*,
/// traits::{EdgesBuilder, VocabularyBuilder},
/// };
///
/// let nodes: Vec<usize> = vec![0, 1, 2];
/// let edges: Vec<(usize, usize)> = vec![(0, 1), (1, 2)];
/// let nodes: SortedVec<usize> = GenericVocabularyBuilder::default()
/// .expected_number_of_symbols(nodes.len())
/// .symbols(nodes.into_iter().enumerate())
/// .build()
/// .unwrap();
/// let edges: SymmetricCSR2D<CSR2D<usize, usize, usize>> =
/// GenericUndirectedMonopartiteEdgesBuilder::<
/// _,
/// UpperTriangularCSR2D<CSR2D<usize, usize, usize>>,
/// SymmetricCSR2D<CSR2D<usize, usize, usize>>,
/// >::default()
/// .expected_number_of_edges(edges.len())
/// .expected_shape(nodes.len())
/// .edges(edges.into_iter())
/// .build()
/// .unwrap();
/// let graph: GenericGraph<SortedVec<usize>, SymmetricCSR2D<CSR2D<usize, usize, usize>>> =
/// GenericGraph::from((nodes, edges));
///
/// assert_eq!(graph.degree(1), 2);
/// # }
/// ```
#[inline]
fn degree(&self, node: Self::NodeId) -> Self::NodeId {
self.edges().degree(node)
}
/// Returns the iterator over the degrees of the nodes in the graph.
///
/// # Examples
///
/// ```
/// # #[cfg(feature = "alloc")]
/// # {
/// use geometric_traits::{
/// impls::{CSR2D, SortedVec, SymmetricCSR2D, UpperTriangularCSR2D},
/// naive_structs::{GenericGraph, GenericUndirectedMonopartiteEdgesBuilder},
/// prelude::*,
/// traits::{EdgesBuilder, VocabularyBuilder},
/// };
///
/// let nodes: Vec<usize> = vec![0, 1, 2];
/// let edges: Vec<(usize, usize)> = vec![(0, 1), (1, 2)];
/// let nodes: SortedVec<usize> = GenericVocabularyBuilder::default()
/// .expected_number_of_symbols(nodes.len())
/// .symbols(nodes.into_iter().enumerate())
/// .build()
/// .unwrap();
/// let edges: SymmetricCSR2D<CSR2D<usize, usize, usize>> =
/// GenericUndirectedMonopartiteEdgesBuilder::<
/// _,
/// UpperTriangularCSR2D<CSR2D<usize, usize, usize>>,
/// SymmetricCSR2D<CSR2D<usize, usize, usize>>,
/// >::default()
/// .expected_number_of_edges(edges.len())
/// .expected_shape(nodes.len())
/// .edges(edges.into_iter())
/// .build()
/// .unwrap();
/// let graph: GenericGraph<SortedVec<usize>, SymmetricCSR2D<CSR2D<usize, usize, usize>>> =
/// GenericGraph::from((nodes, edges));
///
/// let degrees: Vec<usize> = graph.degrees().collect();
/// assert_eq!(degrees, vec![1, 2, 1]);
/// # }
/// ```
#[inline]
fn degrees(&self) -> <<Self::UndirectedMonopartiteEdges as UndirectedMonopartiteEdges>::SymmetricSquaredMatrix as SizedRowsSparseMatrix2D>::SparseRowSizes<'_>{
self.edges().degrees()
}
}
impl<G> UndirectedMonopartiteMonoplexGraph for G
where
G: MonoplexMonopartiteGraph
+ TransposedMonoplexGraph<TransposedEdges = G::MonoplexMonopartiteEdges>,
G::MonoplexMonopartiteEdges: UndirectedMonopartiteEdges,
{
type UndirectedMonopartiteEdges = G::MonoplexMonopartiteEdges;
}