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
|
/*
IGraph library.
Copyright (C) 2021 The igraph development team <igraph@igraph.org>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#include <igraph.h>
#include "test_utilities.h"
int main(void) {
igraph_t g1, g2;
igraph_bool_t res;
/* undirected graphs */
igraph_small(&g1, 4, 0,
0, 1, 1, 2, 2, 3, 3, 0, -1);
igraph_small(&g2, 4, 0,
1, 0, 1, 2, 2, 3, 3, 0, -1);
/* a graph is always same as itself */
igraph_is_same_graph(&g1, &g1, &res);
IGRAPH_ASSERT(res);
/* undirected graphs should be the same no matter
* the direction of the edges (one is swapped in g2 */
igraph_is_same_graph(&g1, &g2, &res);
IGRAPH_ASSERT(res);
/* end of undirected */
igraph_destroy(&g1);
igraph_destroy(&g2);
/* directed graphs */
igraph_small(&g1, 4, 1,
0, 1, 1, 2, 2, 3, 3, 0, -1);
igraph_small(&g2, 4, 1,
1, 0, 1, 2, 2, 3, 3, 0, -1);
/* directed graphs should not be the same if an
* edge has the opposite direction */
igraph_is_same_graph(&g1, &g2, &res);
IGRAPH_ASSERT(!res);
igraph_destroy(&g2);
/* change order of edges, they should be reordered by graph->ii */
igraph_small(&g2, 4, 1,
1, 2, 0, 1, 2, 3, 3, 0, -1);
igraph_is_same_graph(&g1, &g2, &res);
IGRAPH_ASSERT(res);
/* end of directed */
igraph_destroy(&g1);
igraph_destroy(&g2);
/* undirected vs directed */
igraph_small(&g1, 4, 0,
0, 1, 1, 2, 2, 3, 3, 0, -1);
igraph_small(&g2, 4, 1,
0, 1, 1, 2, 2, 3, 3, 0, -1);
igraph_is_same_graph(&g1, &g2, &res);
IGRAPH_ASSERT(!res);
/* end of undirected vs directed */
igraph_destroy(&g1);
igraph_destroy(&g2);
VERIFY_FINALLY_STACK();
return 0;
}
|
