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
|
/*
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 <stdio.h>
#include "test_utilities.h"
void print_and_destroy(igraph_t *graph, igraph_bool_t unconn) {
igraph_real_t res, unconn_pairs;
igraph_average_path_length(graph, &res, &unconn_pairs, IGRAPH_DIRECTED, unconn);
printf("Average shortest path length: ");
print_real(stdout, res, "%g");
printf("\nNo. of unconnected pairs: %g\n", unconn_pairs);
igraph_destroy(graph);
}
int main(void) {
igraph_t graph;
printf("Null graph:\n");
igraph_empty(&graph, 0, IGRAPH_UNDIRECTED);
print_and_destroy(&graph, 1);
printf("\nSingleton graph:\n");
igraph_empty(&graph, 1, IGRAPH_DIRECTED);
print_and_destroy(&graph, 1);
printf("\n2-vertex empty graph, unconn=true:\n");
igraph_empty(&graph, 2, IGRAPH_UNDIRECTED);
print_and_destroy(&graph, 1);
printf("\n2-vertex empty graph, unconn=false:\n");
igraph_empty(&graph, 2, IGRAPH_UNDIRECTED);
print_and_destroy(&graph, 0);
printf("\nSmallest bifurcating directed tree, unconn=true:\n");
igraph_small(&graph, 2, IGRAPH_DIRECTED,
0,1, 0,2, -1);
print_and_destroy(&graph, 1);
printf("\nSmallest bifurcating directed tree, unconn=false:\n");
igraph_small(&graph, 2, IGRAPH_DIRECTED,
0,1, 0,2, -1);
print_and_destroy(&graph, 1);
printf("\nUndirected 11-cycle:\n");
igraph_ring(&graph, 11, IGRAPH_UNDIRECTED, 0, 1);
print_and_destroy(&graph, 1);
printf("\nDirected 6-cycle:\n");
igraph_ring(&graph, 11, IGRAPH_DIRECTED, 0, 1);
print_and_destroy(&graph, 1);
/* Result verified by szhorvat on 2021-03-04. */
printf("\nDe Bruijn graph, n=3 and m=5:\n");
igraph_de_bruijn(&graph, 3, 5);
print_and_destroy(&graph, 1);
VERIFY_FINALLY_STACK();
return 0;
}
|
