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
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
|
# Check functions calculating structural properties
# Test suite for the IGraph library.
# Copyright (C) 2005 Gabor Csardi <csardi@rmki.kfki.hu>
# MTA RMKI, Konkoly-Thege Miklos st. 29-33, Budapest 1121, Hungary
#
# 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, write to the Free Software
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
# 02110-1301 USA
AT_BANNER([[Structural properties]])
AT_SETUP([Diameter of a graph (igraph_diameter):])
AT_KEYWORDS([igraph_diameter])
AT_COMPILE_CHECK([simple/igraph_diameter.c], [simple/igraph_diameter.out])
AT_CLEANUP
AT_SETUP([Average geodesic length (igraph_average_path_length): ])
AT_KEYWORDS([igraph_average_path_length])
AT_COMPILE_CHECK([simple/igraph_average_path_length.c])
AT_CLEANUP
AT_SETUP([Google PageRank (igraph_pagerank): ])
AT_KEYWORDS([igraph_pagerank])
AT_COMPILE_CHECK([simple/igraph_pagerank.c], [simple/igraph_pagerank.out])
AT_CLEANUP
AT_SETUP([Random rewiring (igraph_rewire): ])
AT_KEYWORDS([igraph_rewire])
AT_COMPILE_CHECK([simple/igraph_rewire.c], [simple/igraph_rewire.out])
AT_CLEANUP
AT_SETUP([Get the shortest paths (igraph_get_shortest_paths): ])
AT_KEYWORDS([igraph_get_shortest_paths shortest paths geodesic])
AT_COMPILE_CHECK([simple/igraph_get_shortest_paths.c],
[simple/igraph_get_shortest_paths.out])
AT_CLEANUP
AT_SETUP([Weighted shortest paths (Dijkstra): ])
AT_KEYWORDS([igraph_shortest_paths_dijkstra Dijkstra shortest paths geodesic])
AT_COMPILE_CHECK([simple/dijkstra.c], [simple/dijkstra.out])
AT_CLEANUP
AT_SETUP([Weighted shortest paths (Bellman-Ford): ])
AT_KEYWORDS([igraph_shortest_paths_bellman_ford Bellman-Ford shortest paths geodesic])
AT_COMPILE_CHECK([simple/bellman_ford.c], [simple/bellman_ford.out])
AT_CLEANUP
AT_SETUP([Get the weighted shortest paths (Dijkstra): ])
AT_KEYWORDS([igraph_get_shortest_paths_dijkstra Dijkstra shortest paths geodesic])
AT_COMPILE_CHECK([simple/igraph_get_shortest_paths_dijkstra.c],
[simple/igraph_get_shortest_paths_dijkstra.out])
AT_CLEANUP
AT_SETUP([Edge betweenness (igraph_edge_betweenness): ])
AT_KEYWORDS([igraph_edge_betweenness betwenness])
AT_COMPILE_CHECK([simple/igraph_edge_betweenness.c],
[simple/igraph_edge_betweenness.out])
AT_CLEANUP
AT_SETUP([Transitivity (igraph_transitivity): ])
AT_KEYWORDS([igraph_transitivity transitivity igraph_transitivity_undirected])
AT_COMPILE_CHECK([simple/igraph_transitivity.c])
AT_CLEANUP
AT_SETUP([Reciprocity (igraph_reciprocity): ])
AT_KEYWORDS([igraph_reciprocity reciprocity])
AT_COMPILE_CHECK([simple/igraph_reciprocity.c])
AT_CLEANUP
AT_SETUP([Minimum spanning tree (igraph_minimum_spanning_tree_*): ])
AT_KEYWORDS([igraph_minimum_spanning_tree_prim Prim minimum spanning tree])
AT_COMPILE_CHECK([simple/igraph_minimum_spanning_tree.c],
[simple/igraph_minimum_spanning_tree.out])
AT_CLEANUP
AT_SETUP([Cocitation and bibcoupling (igraph_cocitation,igraph_bibcoupling):])
AT_KEYWORDS([cocitation bibliographic coupling])
AT_COMPILE_CHECK([simple/igraph_cocitation.c], [simple/igraph_cocitation.out])
AT_CLEANUP
AT_SETUP([Similarity coefficients (igraph_similarity_*):])
AT_KEYWORDS([similarity jaccard dice])
AT_COMPILE_CHECK([simple/igraph_similarity.c], [simple/igraph_similarity.out])
AT_CLEANUP
AT_SETUP([Simplification of non-simple graphs (igraph_simplify): ])
AT_KEYWORDS([simplify multiple edge loop edges non-simple graphs simple graphs])
AT_COMPILE_CHECK([simple/igraph_simplify.c], [simple/igraph_simplify.out])
AT_CLEANUP
AT_SETUP([Topological sorting (igraph_topological_sorting, igraph_is_dag): ])
AT_KEYWORDS([topological sorting directed acyclic graphs])
AT_COMPILE_CHECK([simple/igraph_topological_sorting.c], [simple/igraph_topological_sorting.out])
AT_CLEANUP
AT_SETUP([Loop edges test (igraph_is_loop): ])
AT_KEYWORDS([loop edge igraph_is_loop])
AT_COMPILE_CHECK([simple/igraph_is_loop.c], [simple/igraph_is_loop.out])
AT_CLEANUP
AT_SETUP([Multiple edges test (igraph_is_multiple): ])
AT_KEYWORDS([multiple edge parallel edge igraph_is_multiple])
AT_COMPILE_CHECK([simple/igraph_is_multiple.c], [simple/igraph_is_multiple.out])
AT_CLEANUP
AT_SETUP([Girth (igraph_girth): ])
AT_KEYWORDS([girth igraph_girth])
AT_COMPILE_CHECK([simple/igraph_girth.c])
AT_CLEANUP
AT_SETUP([Convergence degree (igraph_convergence_degree): ])
AT_KEYWORDS([edge convergence degree igraph_convergence_degree])
AT_COMPILE_CHECK([simple/igraph_convergence_degree.c], [simple/igraph_convergence_degree.out])
AT_CLEANUP
AT_SETUP([Average nearest neighbor degree (igraph_avg_nearest_neighbor_degree): ])
AT_KEYWORDS([nearest neighbor degree degree correlations])
AT_COMPILE_CHECK([simple/igraph_knn.c])
AT_CLEANUP
|
