1 use petgraph::operator::complement;
2 use petgraph::prelude::*;
3 use petgraph::Graph;
4
5 #[test]
test_complement()6 fn test_complement() {
7 let mut graph: Graph<(), (), Directed> = Graph::new();
8 let a = graph.add_node(());
9 let b = graph.add_node(());
10 let c = graph.add_node(());
11 let d = graph.add_node(());
12
13 graph.extend_with_edges(&[(a, b), (b, c), (c, d)]);
14 let mut output: Graph<(), (), Directed> = Graph::new();
15
16 complement(&graph, &mut output, ());
17
18 let mut expected_res: Graph<(), (), Directed> = Graph::new();
19 let a = expected_res.add_node(());
20 let b = expected_res.add_node(());
21 let c = expected_res.add_node(());
22 let d = expected_res.add_node(());
23 expected_res.extend_with_edges(&[
24 (a, c),
25 (a, d),
26 (b, a),
27 (b, d),
28 (c, a),
29 (c, b),
30 (d, a),
31 (d, b),
32 (d, c),
33 ]);
34
35 for x in graph.node_indices() {
36 for y in graph.node_indices() {
37 assert_eq!(output.contains_edge(x, y), expected_res.contains_edge(x, y));
38 }
39 }
40 }
41