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
//! Check whether a digraph is another digraph's superdigraph.
//!
//! If digraph `H` is a subdigraph of digraph `D`, then `D` is a superdigraph
//! of `H`; the vertex set of `H` is a subset of the vertex set of `D` and the
//! arc set of `H` is a subset of the arc set of `D`. Additionally, the
//! end-vertices of each arc in `H` must be vertices in `H`.
//!
//! # Examples
//!
//! ```
//! use graaf::{
//! AddArc,
//! AdjacencyList,
//! Circuit,
//! Empty,
//! IsSuperdigraph,
//! };
//!
//! let mut h = AdjacencyList::empty(3);
//!
//! h.add_arc(0, 1);
//!
//! let d = AdjacencyList::circuit(3);
//!
//! assert!(d.is_superdigraph(&h));
//!
//! h.add_arc(0, 2);
//!
//! assert!(!d.is_superdigraph(&h));
//! ```
//!
//! Every digraph is a superdigraph of itself.
//!
//! ```
//! use graaf::{
//! AdjacencyList,
//! IsSuperdigraph,
//! RandomTournament,
//! };
//!
//! let tournament = AdjacencyList::random_tournament(4, 0);
//!
//! assert!(tournament.is_superdigraph(&tournament));
//! ```
use crate::IsSubdigraph;
/// Check whether a digraph is another digraph's superdigraph.
pub trait IsSuperdigraph {
/// Check whether the digraph is another digraph's superdigraph.
///
/// # Arguments
///
/// * `d`: The digraph to compare against.
///
/// # Examples
///
/// ```
/// use graaf::{
/// AddArc,
/// AdjacencyList,
/// Circuit,
/// Empty,
/// IsSuperdigraph,
/// };
///
/// let mut h = AdjacencyList::empty(3);
///
/// h.add_arc(0, 1);
///
/// let d = AdjacencyList::circuit(4);
///
/// assert!(d.is_superdigraph(&h));
///
/// h.add_arc(0, 2);
///
/// assert!(!d.is_superdigraph(&h));
/// ```
///
/// Every digraph is a superdigraph of itself.
///
/// ```
/// use graaf::{
/// AdjacencyList,
/// IsSuperdigraph,
/// RandomTournament,
/// };
///
/// let tournament = AdjacencyList::random_tournament(4, 0);
///
/// assert!(tournament.is_superdigraph(&tournament));
/// ```
#[must_use]
fn is_superdigraph(&self, d: &Self) -> bool;
}
impl<D> IsSuperdigraph for D
where
D: IsSubdigraph,
{
fn is_superdigraph(&self, d: &Self) -> bool {
d.is_subdigraph(self)
}
}