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
//! Generate a digraph's complement.
//!
//! A digraph's complement contains all arcs not in the original digraph.
//!
//! # Examples
//!
//! ```
//! use graaf::{
//! AdjacencyList,
//! Arcs,
//! Circuit,
//! Complement,
//! };
//!
//! let digraph = AdjacencyList::circuit(4);
//! let converse = digraph.complement();
//!
//! assert!(converse.arcs().eq([
//! (0, 2),
//! (0, 3),
//! (1, 0),
//! (1, 3),
//! (2, 0),
//! (2, 1),
//! (3, 1),
//! (3, 2)
//! ]));
//! ```
/// Digraph complement
pub trait Complement {
/// Generate the digraph's complement.
///
/// # Examples
///
/// ```
/// use graaf::{
/// AdjacencyList,
/// Arcs,
/// Circuit,
/// Complement,
/// };
///
/// let digraph = AdjacencyList::circuit(4);
/// let converse = digraph.complement();
///
/// assert!(converse.arcs().eq([
/// (0, 2),
/// (0, 3),
/// (1, 0),
/// (1, 3),
/// (2, 0),
/// (2, 1),
/// (3, 1),
/// (3, 2)
/// ]));
/// ```
#[must_use]
fn complement(&self) -> Self;
}