-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathgraphtheory.h
319 lines (307 loc) · 13 KB
/
graphtheory.h
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
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
/*
* graphtheory.h
*
* (c) 2018 Luka Marohnić
*
* 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 3 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 <http://www.gnu.org/licenses/>.
*/
#ifndef GRAPHTHEORY_H
#define GRAPHTHEORY_H
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include "first.h"
#include "graphe.h"
#ifndef NO_NAMESPACE_GIAC
namespace giac {
#endif // ndef NO_NAMESPACE_GIAC
enum gt_error_code {
_GT_ERR_UNKNOWN = 0,
_GT_ERR_NOT_A_GRAPH = 1,
_GT_ERR_WEIGHTED_GRAPH_REQUIRED = 2,
_GT_ERR_UNWEIGHTED_GRAPH_REQUIRED = 3,
_GT_ERR_DIRECTED_GRAPH_REQUIRED = 4,
_GT_ERR_UNDIRECTED_GRAPH_REQUIRED = 5,
_GT_ERR_INVALID_EDGE = 6,
_GT_ERR_INVALID_EDGE_ARC_MIX = 7,
_GT_ERR_MATRIX_NOT_SYMMETRIC = 8,
_GT_ERR_READING_FAILED = 9,
_GT_ERR_EDGE_NOT_FOUND = 10,
_GT_ERR_VERTEX_NOT_FOUND = 11,
_GT_ERR_NOT_A_TREE=12,
_GT_ERR_INVALID_NUMBER_OF_ROOTS=13,
_GT_ERR_INVALID_ROOT=14,
_GT_ERR_NOT_PLANAR=15,
_GT_ERR_CONNECTED_GRAPH_REQUIRED=16,
_GT_ERR_INVALID_DRAWING_METHOD=17,
_GT_ERR_NOT_A_CYCLE=18,
_GT_ERR_CYCLE_NOT_FOUND=19,
_GT_ERR_NAME_NOT_RECOGNIZED=20,
_GT_ERR_NOT_A_SUBGRAPH=21,
_GT_ERR_GRAPH_IS_NULL=22,
_GT_ERR_TAGVALUE_PAIR_EXPECTED=23,
_GT_ERR_NOT_A_GRAPHIC_SEQUENCE=24,
_GT_ERR_NOT_ACYCLIC_GRAPH=25,
_GT_ERR_BICONNECTED_GRAPH_REQUIRED=26,
_GT_ERR_NOT_BIPARTITE=27,
_GT_ERR_WRONG_NUMBER_OF_ARGS=28,
_GT_ERR_POSITIVE_INTEGER_REQUIRED=29,
_GT_ERR_BAD_VERTICES=30,
_GT_ERR_UNASSIGNED_IDENTIFIER_EXPECTED=31
};
enum distribution_type {
_DISTR_UNIFORM,
_DISTR_POISSON,
_DISTR_EXPONENTIAL,
_DISTR_GEOMETRIC,
_DISTR_NORMAL,
_DISTR_FISHER,
_DISTR_CHISQUARE,
_DISTR_CAUCHY,
_DISTR_STUDENT,
_DISTR_MULTINOMIAL,
_DISTR_BINOMIAL,
_DISTR_GAMMA,
_DISTR_BETA,
_DISTR_WEIBULL,
_DISTR_DISCRETE
};
// GRAPH THEORY GIAC COMMANDS
bool is_graphe(const gen &g);
gen _graph(const gen &g,GIAC_CONTEXT);
gen _digraph(const gen &g,GIAC_CONTEXT);
gen _export_graph(const gen &g,GIAC_CONTEXT);
gen _import_graph(const gen &g,GIAC_CONTEXT);
gen _trail(const gen &g,GIAC_CONTEXT);
gen _trail2edges(const gen &g,GIAC_CONTEXT);
gen _draw_graph(const gen &g,GIAC_CONTEXT);
gen _graph_complement(const gen &g,GIAC_CONTEXT);
gen _induced_subgraph(const gen &g,GIAC_CONTEXT);
gen _make_directed(const gen &g,GIAC_CONTEXT);
gen _seidel_switch(const gen &g,GIAC_CONTEXT);
gen _complete_graph(const gen &g,GIAC_CONTEXT);
gen _make_weighted(const gen &g,GIAC_CONTEXT);
gen _subgraph(const gen &g,GIAC_CONTEXT);
gen _underlying_graph(const gen &g,GIAC_CONTEXT);
gen _cycle_graph(const gen &g,GIAC_CONTEXT);
gen _path_graph(const gen &g,GIAC_CONTEXT);
gen _lcf_graph(const gen &g,GIAC_CONTEXT);
gen _add_arc(const gen &g,GIAC_CONTEXT);
gen _add_edge(const gen &g,GIAC_CONTEXT);
gen _add_vertex(const gen &g,GIAC_CONTEXT);
gen _delete_arc(const gen &g,GIAC_CONTEXT);
gen _delete_edge(const gen &g,GIAC_CONTEXT);
gen _delete_vertex(const gen &g,GIAC_CONTEXT);
gen _contract_edge(const gen &g,GIAC_CONTEXT);
gen _set_graph_attribute(const gen &g,GIAC_CONTEXT);
gen _get_graph_attribute(const gen &g,GIAC_CONTEXT);
gen _discard_graph_attribute(const gen &g,GIAC_CONTEXT);
gen _list_graph_attributes(const gen &g,GIAC_CONTEXT);
gen _set_vertex_attribute(const gen &g,GIAC_CONTEXT);
gen _get_vertex_attribute(const gen &g,GIAC_CONTEXT);
gen _discard_vertex_attribute(const gen &g,GIAC_CONTEXT);
gen _list_vertex_attributes(const gen &g,GIAC_CONTEXT);
gen _set_node_attribute(const gen &g,GIAC_CONTEXT);
gen _get_node_attribute(const gen &g,GIAC_CONTEXT);
gen _discard_node_attribute(const gen &g,GIAC_CONTEXT);
gen _list_edge_attributes(const gen &g,GIAC_CONTEXT);
gen _adjacency_matrix(const gen &g,GIAC_CONTEXT);
gen _incidence_matrix(const gen &g,GIAC_CONTEXT);
gen _biconnected_components(const gen &g,GIAC_CONTEXT);
gen _connected_components(const gen &g,GIAC_CONTEXT);
gen _departures(const gen &g,GIAC_CONTEXT);
gen _incident_edges(const gen &g,GIAC_CONTEXT);
gen _number_of_triangles(const gen &g,GIAC_CONTEXT);
gen _is_connected(const gen &g,GIAC_CONTEXT);
gen _is_biconnected(const gen &g,GIAC_CONTEXT);
gen _is_triconnected(const gen &g,GIAC_CONTEXT);
gen _is_weighted(const gen &g,GIAC_CONTEXT);
gen _is_forest(const gen &g,GIAC_CONTEXT);
gen _is_tournament(const gen &g,GIAC_CONTEXT);
gen _is_planar(const gen &g,GIAC_CONTEXT);
gen _is_tree(const gen &g,GIAC_CONTEXT);
gen _tree_height(const gen &g,GIAC_CONTEXT);
gen _pruefer_code(const gen &g,GIAC_CONTEXT);
gen _maximum_matching(const gen &g,GIAC_CONTEXT);
gen _bipartite_matching(const gen &g,GIAC_CONTEXT);
gen _number_of_edges(const gen &g,GIAC_CONTEXT);
gen _edges(const gen &g,GIAC_CONTEXT);
gen _has_arc(const gen &g,GIAC_CONTEXT);
gen _arrivals(const gen &g,GIAC_CONTEXT);
gen _articulation_points(const gen &g,GIAC_CONTEXT);
gen _vertex_in_degree(const gen &g,GIAC_CONTEXT);
gen _vertex_out_degree(const gen &g,GIAC_CONTEXT);
gen _vertex_degree(const gen &g,GIAC_CONTEXT);
gen _get_edge_weight(const gen &g,GIAC_CONTEXT);
gen _set_edge_weight(const gen &g,GIAC_CONTEXT);
gen _has_edge(const gen &g,GIAC_CONTEXT);
gen _is_directed(const gen &g,GIAC_CONTEXT);
gen _minimum_degree(const gen &g,GIAC_CONTEXT);
gen _maximum_degree(const gen &g,GIAC_CONTEXT);
gen _is_regular(const gen &g,GIAC_CONTEXT);
gen _is_strongly_regular(const gen &g,GIAC_CONTEXT);
gen _neighbors(const gen &g,GIAC_CONTEXT);
gen _number_of_vertices(const gen &g,GIAC_CONTEXT);
gen _graph_vertices(const gen &g,GIAC_CONTEXT);
gen _relabel_vertices(const gen &g,GIAC_CONTEXT);
gen _permute_vertices(const gen &g,GIAC_CONTEXT);
gen _isomorphic_copy(const gen &g,GIAC_CONTEXT);
gen _weight_matrix(const gen &g,GIAC_CONTEXT);
gen _hypercube_graph(const gen &g,GIAC_CONTEXT);
gen _sierpinski_graph(const gen &g,GIAC_CONTEXT);
gen _petersen_graph(const gen &g,GIAC_CONTEXT);
gen _complete_binary_tree(const gen &g,GIAC_CONTEXT);
gen _complete_kary_tree(const gen &g,GIAC_CONTEXT);
gen _prism_graph(const gen &g,GIAC_CONTEXT);
gen _antiprism_graph(const gen &g,GIAC_CONTEXT);
gen _star_graph(const gen &g,GIAC_CONTEXT);
gen _grid_graph(const gen &g,GIAC_CONTEXT);
gen _torus_grid_graph(const gen &g,GIAC_CONTEXT);
gen _web_graph(const gen &g,GIAC_CONTEXT);
gen _wheel_graph(const gen &g,GIAC_CONTEXT);
gen _kneser_graph(const gen &g,GIAC_CONTEXT);
gen _johnson_graph(const gen &g,GIAC_CONTEXT);
gen _odd_graph(const gen &g,GIAC_CONTEXT);
gen _flower_snark(const gen &g,GIAC_CONTEXT);
gen _goldberg_snark(const gen &g,GIAC_CONTEXT);
gen _haar_graph(const gen &g,GIAC_CONTEXT);
gen _paley_graph(const gen &g,GIAC_CONTEXT);
gen _random_graph(const gen &g,GIAC_CONTEXT);
gen _random_digraph(const gen &g,GIAC_CONTEXT);
gen _random_regular_graph(const gen &g,GIAC_CONTEXT);
gen _random_sequence_graph(const gen &g,GIAC_CONTEXT);
gen _random_bipartite_graph(const gen &g,GIAC_CONTEXT);
gen _random_tournament(const gen &g,GIAC_CONTEXT);
gen _random_tree(const gen &g,GIAC_CONTEXT);
gen _random_planar_graph(const gen &g,GIAC_CONTEXT);
gen _assign_edge_weights(const gen &g,GIAC_CONTEXT);
gen _cartesian_product(const gen &g,GIAC_CONTEXT);
gen _tensor_product(const gen &g,GIAC_CONTEXT);
gen _is_eulerian(const gen &g,GIAC_CONTEXT);
gen _highlight_vertex(const gen &g,GIAC_CONTEXT);
gen _highlight_edges(const gen &g,GIAC_CONTEXT);
gen _highlight_subgraph(const gen &g,GIAC_CONTEXT);
gen _highlight_trail(const gen &g,GIAC_CONTEXT);
gen _disjoint_union(const gen &g,GIAC_CONTEXT);
gen _graph_union(const gen &g,GIAC_CONTEXT);
gen _graph_join(const gen &g,GIAC_CONTEXT);
gen _graph_equal(const gen &g,GIAC_CONTEXT);
gen _reverse_graph(const gen &g,GIAC_CONTEXT);
gen _interval_graph(const gen &g,GIAC_CONTEXT);
gen _subdivide_edges(const gen &g,GIAC_CONTEXT);
gen _graph_power(const gen &g,GIAC_CONTEXT);
gen _vertex_distance(const gen &g,GIAC_CONTEXT);
gen _shortest_path(const gen &g,GIAC_CONTEXT);
gen _dijkstra(const gen &g,GIAC_CONTEXT);
gen _bellman_ford(const gen &g,GIAC_CONTEXT);
gen _allpairs_distance(const gen &g,GIAC_CONTEXT);
gen _graph_diameter(const gen &g,GIAC_CONTEXT);
gen _is_clique(const gen &g,GIAC_CONTEXT);
gen _maximum_clique(const gen &g,GIAC_CONTEXT);
gen _clique_number(const gen &g,GIAC_CONTEXT);
gen _clique_cover(const gen &g,GIAC_CONTEXT);
gen _clique_cover_number(const gen &g,GIAC_CONTEXT);
gen _chromatic_number(const gen &g,GIAC_CONTEXT);
gen _maximum_independent_set(const gen &g,GIAC_CONTEXT);
gen _independence_number(const gen &g,GIAC_CONTEXT);
gen _strongly_connected_components(const gen &g,GIAC_CONTEXT);
gen _is_strongly_connected(const gen &g,GIAC_CONTEXT);
gen _condensation(const gen &g,GIAC_CONTEXT);
gen _degree_sequence(const gen &g,GIAC_CONTEXT);
gen _is_graphic_sequence(const gen &g,GIAC_CONTEXT);
gen _sequence_graph(const gen &g,GIAC_CONTEXT);
gen _girth(const gen &g,GIAC_CONTEXT);
gen _odd_girth(const gen &g,GIAC_CONTEXT);
gen _topologic_sort(const gen &g,GIAC_CONTEXT);
gen _is_acyclic(const gen &g,GIAC_CONTEXT);
gen _is_arborescence(const gen &g,GIAC_CONTEXT);
gen _graph_spectrum(const gen &g,GIAC_CONTEXT);
gen _graph_charpoly(const gen &g,GIAC_CONTEXT);
gen _seidel_spectrum(const gen &g,GIAC_CONTEXT);
gen _is_integer_graph(const gen &g,GIAC_CONTEXT);
gen _spanning_tree(const gen &g,GIAC_CONTEXT);
gen _number_of_spanning_trees(const gen &g,GIAC_CONTEXT);
gen _minimal_spanning_tree(const gen &g,GIAC_CONTEXT);
gen _graph_rank(const gen &g,GIAC_CONTEXT);
gen _lowest_common_ancestor(const gen &g,GIAC_CONTEXT);
gen _st_ordering(const gen &g,GIAC_CONTEXT);
gen _is_bipartite(const gen &g,GIAC_CONTEXT);
gen _greedy_color(const gen &g,GIAC_CONTEXT);
gen _is_vertex_colorable(const gen &g,GIAC_CONTEXT);
gen _plane_dual(const gen &g,GIAC_CONTEXT);
gen _set_vertex_positions(const gen &g,GIAC_CONTEXT);
gen _find_cliques(const gen &g,GIAC_CONTEXT);
gen _minimal_vertex_coloring(const gen &g,GIAC_CONTEXT);
gen _transitive_closure(const gen &g,GIAC_CONTEXT);
gen _line_graph(const gen &g,GIAC_CONTEXT);
gen _is_isomorphic(const gen &g,GIAC_CONTEXT);
gen _is_subgraph_isomorphic(const gen &g,GIAC_CONTEXT);
gen _identify_graph(const gen &g,GIAC_CONTEXT);
gen _graph_automorphisms(const gen &g,GIAC_CONTEXT);
gen _canonical_labeling(const gen &g,GIAC_CONTEXT);
gen _minimal_edge_coloring(const gen &g,GIAC_CONTEXT);
gen _chromatic_index(const gen &g,GIAC_CONTEXT);
gen _is_hamiltonian(const gen &g,GIAC_CONTEXT);
gen _traveling_salesman(const gen &g,GIAC_CONTEXT);
gen _maxflow(const gen &g,GIAC_CONTEXT);
gen _minimum_cut(const gen &g,GIAC_CONTEXT);
gen _is_cut_set(const gen &g,GIAC_CONTEXT);
gen _is_network(const gen &g,GIAC_CONTEXT);
gen _random_network(const gen &g,GIAC_CONTEXT);
gen _tutte_polynomial(const gen &g,GIAC_CONTEXT);
gen _chromatic_polynomial(const gen &g,GIAC_CONTEXT);
gen _flow_polynomial(const gen &g,GIAC_CONTEXT);
gen _reliability_polynomial(const gen &g,GIAC_CONTEXT);
gen _laplacian_matrix(const gen &g,GIAC_CONTEXT);
gen _fundamental_cycle(const gen &g,GIAC_CONTEXT);
gen _cycle_basis(const gen &g,GIAC_CONTEXT);
gen _mycielski(const gen &g,GIAC_CONTEXT);
gen _clustering_coefficient(const gen &g,GIAC_CONTEXT);
gen _network_transitivity(const gen &g,GIAC_CONTEXT);
gen _two_edge_connected_components(const gen &g,GIAC_CONTEXT);
gen _is_two_edge_connected(const gen &g,GIAC_CONTEXT);
gen _edge_connectivity(const gen &g,GIAC_CONTEXT);
gen _vertex_connectivity(const gen &g,GIAC_CONTEXT);
gen _tonnetz(const gen &g,GIAC_CONTEXT);
gen _truncate_graph(const gen &g,GIAC_CONTEXT);
gen _find_cycles(const gen &g,GIAC_CONTEXT);
gen _kspaths(const gen &g,GIAC_CONTEXT);
gen _degree_centrality(const gen &g,GIAC_CONTEXT);
gen _betweenness_centrality(const gen &g,GIAC_CONTEXT);
gen _communicability_betweenness_centrality(const gen &g,GIAC_CONTEXT);
gen _closeness_centrality(const gen &g,GIAC_CONTEXT);
gen _katz_centrality(const gen &g,GIAC_CONTEXT);
gen _information_centrality(const gen &g,GIAC_CONTEXT);
gen _harmonic_centrality(const gen &g,GIAC_CONTEXT);
gen _is_split_graph(const gen &g,GIAC_CONTEXT);
gen _contract_subgraph(const gen &g,GIAC_CONTEXT);
gen _greedy_clique(const gen &g,GIAC_CONTEXT);
gen _greedy_independent_set(const gen &g,GIAC_CONTEXT);
gen _minimum_vertex_cover(const gen &g,GIAC_CONTEXT);
gen _find_vertex_cover(const gen &g,GIAC_CONTEXT);
gen _vertex_cover_number(const gen &g,GIAC_CONTEXT);
gen _is_reachable(const gen &g,GIAC_CONTEXT);
gen _reachable(const gen &g,GIAC_CONTEXT);
gen _simplicial_vertices(const gen &g,GIAC_CONTEXT);
// GENERAL GIAC COMMANDS
gen _foldl(const gen &g,GIAC_CONTEXT);
gen _foldr(const gen &g,GIAC_CONTEXT);
gen _randvar(const gen &g,GIAC_CONTEXT);
gen _icomp(const gen &g,GIAC_CONTEXT);
// FUNCTION POINTERS
extern const unary_function_ptr * const at_trail;
#ifndef NO_NAMESPACE_GIAC
} // namespace giac
#endif // ndef NO_NAMESPACE_GIAC
#endif // GRAPHTHEORY_H