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
//! k-degenerate graph predicate (ALGO-PR-116).
//!
//! A graph is k-degenerate if every subgraph has a vertex of degree
//! at most k. Equivalently, the degeneracy (maximum coreness) is at
//! most k. 0-degenerate = edgeless, 1-degenerate = forest,
//! 2-degenerate = every subgraph has a vertex of degree ≤ 2.
//!
//! Directed graphs are treated as undirected.
use crate::algorithms::properties::coreness::coreness;
use crate::core::{Graph, IgraphResult};
/// Check whether a graph is k-degenerate.
///
/// A graph is k-degenerate if every non-empty subgraph has a vertex
/// of degree at most k. Uses the coreness decomposition and checks
/// that the maximum core number does not exceed k.
///
/// Directed graphs are treated as undirected.
///
/// # Examples
///
/// ```
/// use rust_igraph::{Graph, is_k_degenerate};
///
/// // Tree is 1-degenerate
/// let mut g = Graph::with_vertices(4);
/// g.add_edge(0, 1).unwrap();
/// g.add_edge(1, 2).unwrap();
/// g.add_edge(1, 3).unwrap();
/// assert!(is_k_degenerate(&g, 1).unwrap());
/// assert!(!is_k_degenerate(&g, 0).unwrap());
///
/// // `K_4` is 3-degenerate but NOT 2-degenerate
/// let mut g = Graph::with_vertices(4);
/// for i in 0..4u32 {
/// for j in (i+1)..4 {
/// g.add_edge(i, j).unwrap();
/// }
/// }
/// assert!(is_k_degenerate(&g, 3).unwrap());
/// assert!(!is_k_degenerate(&g, 2).unwrap());
/// ```
pub fn is_k_degenerate(graph: &Graph, k: u32) -> IgraphResult<bool> {
let n = graph.vcount();
if n == 0 {
return Ok(true);
}
let cores = coreness(graph)?;
let max_core = cores.iter().copied().max().unwrap_or(0);
Ok(max_core <= k)
}
/// Return the degeneracy of a graph.
///
/// The degeneracy is the smallest k such that the graph is
/// k-degenerate, i.e., the maximum coreness value.
///
/// Directed graphs are treated as undirected.
///
/// # Examples
///
/// ```
/// use rust_igraph::{Graph, degeneracy};
///
/// let mut g = Graph::with_vertices(4);
/// g.add_edge(0, 1).unwrap();
/// g.add_edge(1, 2).unwrap();
/// g.add_edge(1, 3).unwrap();
/// assert_eq!(degeneracy(&g).unwrap(), 1);
/// ```
pub fn degeneracy(graph: &Graph) -> IgraphResult<u32> {
let n = graph.vcount();
if n == 0 {
return Ok(0);
}
let cores = coreness(graph)?;
Ok(cores.iter().copied().max().unwrap_or(0))
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn empty_graph() {
let g = Graph::with_vertices(0);
assert!(is_k_degenerate(&g, 0).unwrap());
assert_eq!(degeneracy(&g).unwrap(), 0);
}
#[test]
fn single_vertex() {
let g = Graph::with_vertices(1);
assert!(is_k_degenerate(&g, 0).unwrap());
assert_eq!(degeneracy(&g).unwrap(), 0);
}
#[test]
fn single_edge() {
let mut g = Graph::with_vertices(2);
g.add_edge(0, 1).unwrap();
assert!(!is_k_degenerate(&g, 0).unwrap());
assert!(is_k_degenerate(&g, 1).unwrap());
assert_eq!(degeneracy(&g).unwrap(), 1);
}
#[test]
fn triangle() {
let mut g = Graph::with_vertices(3);
g.add_edge(0, 1).unwrap();
g.add_edge(1, 2).unwrap();
g.add_edge(2, 0).unwrap();
assert!(!is_k_degenerate(&g, 1).unwrap());
assert!(is_k_degenerate(&g, 2).unwrap());
assert_eq!(degeneracy(&g).unwrap(), 2);
}
#[test]
fn tree() {
let mut g = Graph::with_vertices(5);
g.add_edge(0, 1).unwrap();
g.add_edge(1, 2).unwrap();
g.add_edge(1, 3).unwrap();
g.add_edge(3, 4).unwrap();
assert!(is_k_degenerate(&g, 1).unwrap());
assert!(!is_k_degenerate(&g, 0).unwrap());
assert_eq!(degeneracy(&g).unwrap(), 1);
}
#[test]
fn complete_k4() {
let mut g = Graph::with_vertices(4);
for i in 0..4u32 {
for j in (i + 1)..4 {
g.add_edge(i, j).unwrap();
}
}
assert!(!is_k_degenerate(&g, 2).unwrap());
assert!(is_k_degenerate(&g, 3).unwrap());
assert_eq!(degeneracy(&g).unwrap(), 3);
}
#[test]
fn complete_k5() {
let mut g = Graph::with_vertices(5);
for i in 0..5u32 {
for j in (i + 1)..5 {
g.add_edge(i, j).unwrap();
}
}
assert_eq!(degeneracy(&g).unwrap(), 4);
}
#[test]
fn edgeless() {
let g = Graph::with_vertices(5);
assert!(is_k_degenerate(&g, 0).unwrap());
assert_eq!(degeneracy(&g).unwrap(), 0);
}
#[test]
fn star() {
let mut g = Graph::with_vertices(5);
g.add_edge(0, 1).unwrap();
g.add_edge(0, 2).unwrap();
g.add_edge(0, 3).unwrap();
g.add_edge(0, 4).unwrap();
assert!(is_k_degenerate(&g, 1).unwrap());
assert_eq!(degeneracy(&g).unwrap(), 1);
}
#[test]
fn c4() {
// C_4: coreness 2
let mut g = Graph::with_vertices(4);
g.add_edge(0, 1).unwrap();
g.add_edge(1, 2).unwrap();
g.add_edge(2, 3).unwrap();
g.add_edge(3, 0).unwrap();
assert!(is_k_degenerate(&g, 2).unwrap());
assert!(!is_k_degenerate(&g, 1).unwrap());
assert_eq!(degeneracy(&g).unwrap(), 2);
}
#[test]
fn directed_treated_as_undirected() {
let mut g = Graph::new(3, true).unwrap();
g.add_edge(0, 1).unwrap();
g.add_edge(1, 2).unwrap();
g.add_edge(2, 0).unwrap();
assert!(is_k_degenerate(&g, 2).unwrap());
assert_eq!(degeneracy(&g).unwrap(), 2);
}
#[test]
fn large_k_always_true() {
let mut g = Graph::with_vertices(3);
g.add_edge(0, 1).unwrap();
assert!(is_k_degenerate(&g, 100).unwrap());
}
#[test]
fn path() {
let mut g = Graph::with_vertices(5);
g.add_edge(0, 1).unwrap();
g.add_edge(1, 2).unwrap();
g.add_edge(2, 3).unwrap();
g.add_edge(3, 4).unwrap();
assert!(is_k_degenerate(&g, 1).unwrap());
assert_eq!(degeneracy(&g).unwrap(), 1);
}
}