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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
|
<?xml version="1.0"?>
<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN"
"http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
<!ENTITY igraph "igraph">
]>
<chapter id="igraph-Structural">
<title>Structural Properties of Graphs</title>
<!-- doxrox-include about_structural -->
<section id="basic-properties"><title>Basic Properties</title>
<!-- doxrox-include igraph_are_connected -->
</section>
<section id="shortest-path-related-functions"><title>(Shortest) Path Related Functions</title>
<!-- doxrox-include igraph_shortest_paths -->
<!-- doxrox-include igraph_shortest_paths_dijkstra -->
<!-- doxrox-include igraph_shortest_paths_bellman_ford -->
<!-- doxrox-include igraph_shortest_paths_johnson -->
<!-- doxrox-include igraph_get_shortest_paths -->
<!-- doxrox-include igraph_get_shortest_path -->
<!-- doxrox-include igraph_get_shortest_paths_dijkstra -->
<!-- doxrox-include igraph_get_shortest_path_dijkstra -->
<!-- doxrox-include igraph_get_shortest_paths_bellman_ford -->
<!-- doxrox-include igraph_get_shortest_path_bellman_ford -->
<!-- doxrox-include igraph_get_all_shortest_paths -->
<!-- doxrox-include igraph_get_all_shortest_paths_dijkstra -->
<!-- doxrox-include igraph_get_all_simple_paths -->
<!-- doxrox-include igraph_average_path_length -->
<!-- doxrox-include igraph_average_path_length_dijkstra -->
<!-- doxrox-include igraph_path_length_hist -->
<!-- doxrox-include igraph_diameter -->
<!-- doxrox-include igraph_diameter_dijkstra -->
<!-- doxrox-include igraph_girth -->
<!-- doxrox-include igraph_eccentricity -->
<!-- doxrox-include igraph_radius -->
</section>
<section id="efficiency-measures"><title>Efficiency Measures</title>
<!-- doxrox-include igraph_global_efficiency -->
<!-- doxrox-include igraph_local_efficiency -->
<!-- doxrox-include igraph_average_local_efficiency -->
</section>
<section id="neighborhood-of-a-vertex"><title>Neighborhood of a Vertex</title>
<!-- doxrox-include igraph_neighborhood_size -->
<!-- doxrox-include igraph_neighborhood -->
<!-- doxrox-include igraph_neighborhood_graphs -->
</section>
<section id="local-scan-statistics"><title>Local Scan Statistics</title>
<!-- doxrox-include about_local_scan -->
<section id="us-statistics"><title>"Us" statistics</title>
<!-- doxrox-include igraph_local_scan_0 -->
<!-- doxrox-include igraph_local_scan_1_ecount -->
<!-- doxrox-include igraph_local_scan_k_ecount -->
</section>
<section id="them-statistics"><title>"Them" statistics</title>
<!-- doxrox-include igraph_local_scan_0_them -->
<!-- doxrox-include igraph_local_scan_1_ecount_them -->
<!-- doxrox-include igraph_local_scan_k_ecount_them -->
</section>
<section id="pre-calculated-neighborhoods"><title>Pre-calculated neighborhoods</title>
<!-- doxrox-include igraph_local_scan_neighborhood_ecount -->
</section>
</section>
<section id="graph-components"><title>Graph Components</title>
<!-- doxrox-include igraph_subcomponent -->
<!-- doxrox-include igraph_clusters -->
<!-- doxrox-include igraph_is_connected -->
<!-- doxrox-include igraph_decompose -->
<!-- doxrox-include igraph_decompose_destroy -->
<!-- doxrox-include igraph_biconnected_components -->
<!-- doxrox-include igraph_articulation_points -->
<!-- doxrox-include igraph_bridges -->
</section>
<section id="degree-sequences"><title>Degree Sequences</title>
<!-- doxrox-include igraph_is_graphical -->
<!-- doxrox-include igraph_is_bigraphical -->
<!-- doxrox-include igraph_is_degree_sequence -->
<!-- doxrox-include igraph_is_graphical_degree_sequence -->
</section>
<section id="centrality-measures"><title>Centrality Measures</title>
<!-- doxrox-include igraph_closeness -->
<!-- doxrox-include igraph_harmonic_centrality -->
<!-- doxrox-include igraph_betweenness -->
<!-- doxrox-include igraph_edge_betweenness -->
<!-- doxrox-include igraph_pagerank_algo_t -->
<!-- doxrox-include igraph_pagerank -->
<!-- doxrox-include igraph_personalized_pagerank -->
<!-- doxrox-include igraph_personalized_pagerank_vs -->
<!-- doxrox-include igraph_constraint -->
<!-- doxrox-include igraph_maxdegree -->
<!-- doxrox-include igraph_strength -->
<!-- doxrox-include igraph_eigenvector_centrality -->
<!-- doxrox-include igraph_hub_score -->
<!-- doxrox-include igraph_authority_score -->
</section>
<section id="range-limited-centrality-measures"><title>Range-limited Centrality Measures</title>
<!-- doxrox-include igraph_closeness_cutoff -->
<!-- doxrox-include igraph_harmonic_centrality_cutoff -->
<!-- doxrox-include igraph_betweenness_cutoff -->
<!-- doxrox-include igraph_edge_betweenness_cutoff -->
</section>
<section id="centralization"><title>Centralization</title>
<!-- doxrox-include igraph_centralization -->
<!-- doxrox-include igraph_centralization_degree -->
<!-- doxrox-include igraph_centralization_betweenness -->
<!-- doxrox-include igraph_centralization_closeness -->
<!-- doxrox-include igraph_centralization_eigenvector_centrality -->
<!-- doxrox-include igraph_centralization_degree_tmax -->
<!-- doxrox-include igraph_centralization_betweenness_tmax -->
<!-- doxrox-include igraph_centralization_closeness_tmax -->
<!-- doxrox-include igraph_centralization_eigenvector_centrality_tmax -->
</section>
<section id="similarity-measures"><title>Similarity Measures</title>
<!-- doxrox-include igraph_bibcoupling -->
<!-- doxrox-include igraph_cocitation -->
<!-- doxrox-include igraph_similarity_jaccard -->
<!-- doxrox-include igraph_similarity_jaccard_pairs -->
<!-- doxrox-include igraph_similarity_jaccard_es -->
<!-- doxrox-include igraph_similarity_dice -->
<!-- doxrox-include igraph_similarity_dice_pairs -->
<!-- doxrox-include igraph_similarity_dice_es -->
<!-- doxrox-include igraph_similarity_inverse_log_weighted -->
</section>
<section id="trees"><title>Trees</title>
<!-- doxrox-include igraph_minimum_spanning_tree -->
<!-- doxrox-include igraph_minimum_spanning_tree_unweighted -->
<!-- doxrox-include igraph_minimum_spanning_tree_prim -->
<!-- doxrox-include igraph_random_spanning_tree -->
<!-- doxrox-include igraph_is_tree -->
<!-- doxrox-include igraph_to_prufer -->
</section>
<section id="transitivity-or-clustering-coefficient"><title>Transitivity or Clustering Coefficient</title>
<!-- doxrox-include igraph_transitivity_undirected -->
<!-- doxrox-include igraph_transitivity_local_undirected -->
<!-- doxrox-include igraph_transitivity_avglocal_undirected -->
<!-- doxrox-include igraph_transitivity_barrat -->
</section>
<section id="directedness-conversion"><title>Directedness Conversion</title>
<!-- doxrox-include igraph_to_directed -->
<!-- doxrox-include igraph_to_undirected -->
</section>
<section id="spectral-properties"><title>Spectral Properties</title>
<!-- doxrox-include igraph_laplacian -->
</section>
<section id="non-simple-graphs-multiple-and-loop-edges"><title>Non-simple Graphs: Multiple and Loop Edges</title>
<!-- doxrox-include igraph_is_simple -->
<!-- doxrox-include igraph_is_loop -->
<!-- doxrox-include igraph_is_multiple -->
<!-- doxrox-include igraph_has_multiple -->
<!-- doxrox-include igraph_count_multiple -->
</section>
<section id="mixing-patterns"><title>Mixing Patterns</title>
<!-- doxrox-include igraph_assortativity_nominal -->
<!-- doxrox-include igraph_assortativity -->
<!-- doxrox-include igraph_assortativity_degree -->
</section>
<section id="k-cores"><title>K-Cores</title>
<!-- doxrox-include igraph_coreness -->
</section>
<section id="topological-sorting-directed-acyclic-graphs"><title>Topological Sorting, Directed Acyclic Graphs</title>
<!-- doxrox-include igraph_is_dag -->
<!-- doxrox-include igraph_topological_sorting -->
<!-- doxrox-include igraph_feedback_arc_set -->
</section>
<section id="maximum-cardinality-search-graph-decomposition-chordal-graphs"><title>Maximum Cardinality Search, Graph Decomposition, Chordal Graphs</title>
<!-- doxrox-include igraph_maximum_cardinality_search -->
<!-- doxrox-include igraph_is_chordal -->
</section>
<section id="matchings"><title>Matchings</title>
<!-- doxrox-include igraph_is_matching -->
<!-- doxrox-include igraph_is_maximal_matching -->
<!-- doxrox-include igraph_maximum_bipartite_matching -->
</section>
<section id="unfolding-a-graph-into-a-tree"><title>Unfolding a Graph Into a Tree</title>
<!-- doxrox-include igraph_unfold_tree -->
</section>
<section id="other-operations"><title>Other Operations</title>
<!-- doxrox-include igraph_density -->
<!-- doxrox-include igraph_reciprocity -->
<!-- doxrox-include igraph_diversity -->
<!-- doxrox-include igraph_is_mutual -->
<!-- doxrox-include igraph_avg_nearest_neighbor_degree -->
<!-- doxrox-include igraph_get_adjacency -->
<!-- doxrox-include igraph_get_stochastic -->
<!-- doxrox-include igraph_get_stochastic_sparsemat -->
<!-- doxrox-include igraph_get_edgelist -->
</section>
</chapter>
|
