Orbiter 2022
Combinatorial Objects
graph_theoretic_activity_description.cpp
Go to the documentation of this file.
1/*
2 * graph_theoretic_activity_description.cpp
3 *
4 * Created on: Apr 26, 2020
5 * Author: betten
6 */
7
8
9
10
11
12#include "orbiter.h"
13
14using namespace std;
15
16namespace orbiter {
17namespace layer5_applications {
18namespace apps_graph_theory {
19
20
22{
25
30
31 f_print = FALSE;
32
34
35 f_split = FALSE;
36 //std::string split_input_fname;
37 //std::string split_by_file = NULL;
38
40 //std::string split_by_starters_fname_reps;
41 //std::string split_by_starters_col_label;
42
44 //std::string split_by_clique_label;
45 //std::string split_by_clique_set;
46
47 f_save = FALSE;
48
50
52
54
55 f_draw = FALSE;
56
57}
58
60{
61 freeself();
62}
63
65{
66}
67
69{
70 null();
71}
72
74 int argc, std::string *argv,
75 int verbose_level)
76{
77 int f_v = (verbose_level >= 1);
78 int i;
80
81 if (f_v) {
82 cout << "graph_theoretic_activity_description::read_arguments" << endl;
83 }
84 for (i = 0; i < argc; i++) {
85 if (ST.stringcmp(argv[i], "-find_cliques") == 0) {
88 i += Clique_finder_control->parse_arguments(argc - i, argv + i);
89 }
90 else if (ST.stringcmp(argv[i], "-export_magma") == 0) {
92 if (f_v) {
93 cout << "-export_magma" << endl;
94 }
95 }
96 else if (ST.stringcmp(argv[i], "-export_maple") == 0) {
98 if (f_v) {
99 cout << "-export_maple" << endl;
100 }
101 }
102 else if (ST.stringcmp(argv[i], "-export_csv") == 0) {
104 if (f_v) {
105 cout << "-export_csv" << endl;
106 }
107 }
108 else if (ST.stringcmp(argv[i], "-export_graphviz") == 0) {
110 if (f_v) {
111 cout << "-export_graphviz" << endl;
112 }
113 }
114 else if (ST.stringcmp(argv[i], "-print") == 0) {
115 f_print = TRUE;
116 if (f_v) {
117 cout << "-print" << endl;
118 }
119 }
120 else if (ST.stringcmp(argv[i], "-sort_by_colors") == 0) {
122 if (f_v) {
123 cout << "-sort_by_colors " << endl;
124 }
125 }
126 else if (ST.stringcmp(argv[i], "-split") == 0) {
127 f_split = TRUE;
128 split_input_fname.assign(argv[++i]);
129 split_by_file.assign(argv[++i]);
130 if (f_v) {
131 cout << "-split " << split_input_fname << " " << split_by_file << endl;
132 }
133 }
134 else if (ST.stringcmp(argv[i], "-split_by_starters") == 0) {
136 split_by_starters_fname_reps.assign(argv[++i]);
137 split_by_starters_col_label.assign(argv[++i]);
138 if (f_v) {
139 cout << "-split_by_starters " << split_by_starters_fname_reps << " " << split_by_starters_col_label << endl;
140 }
141 }
142 else if (ST.stringcmp(argv[i], "-split_by_clique") == 0) {
144 split_by_clique_label.assign(argv[++i]);
145 split_by_clique_set.assign(argv[++i]);
146 if (f_v) {
147 cout << "-split_by_clique " << split_by_clique_label << " " << split_by_clique_set << endl;
148 }
149 }
150 else if (ST.stringcmp(argv[i], "-save") == 0) {
151 f_save = TRUE;
152 if (f_v) {
153 cout << "-save " << endl;
154 }
155 }
156 else if (ST.stringcmp(argv[i], "-automorphism_group") == 0) {
158 if (f_v) {
159 cout << "-automorphism_group " << endl;
160 }
161 }
162 else if (ST.stringcmp(argv[i], "-properties") == 0) {
164 if (f_v) {
165 cout << "-properties " << endl;
166 }
167 }
168 else if (ST.stringcmp(argv[i], "-eigenvalues") == 0) {
170 if (f_v) {
171 cout << "-eigenvalues " << endl;
172 }
173 }
174 else if (ST.stringcmp(argv[i], "-draw") == 0) {
175 f_draw = TRUE;
176 if (f_v) {
177 cout << "-draw " << endl;
178 }
179 }
180 else if (ST.stringcmp(argv[i], "-end") == 0) {
181 if (f_v) {
182 cout << "-end" << endl;
183 }
184 break;
185 }
186 else {
187 cout << "graph_theoretic_activity_description::read_arguments "
188 "unrecognized option " << argv[i] << endl;
189 }
190
191 } // next i
192 if (f_v) {
193 cout << "graph_theoretic_activity_description::read_arguments done" << endl;
194 }
195 return i + 1;
196}
197
199{
200 if (f_find_cliques) {
201 cout << "-find_cliques" << endl;
203 }
204 if (f_export_magma) {
205 cout << "-export_magma" << endl;
206 }
207 if (f_export_maple) {
208 cout << "-export_maple" << endl;
209 }
210 if (f_export_csv) {
211 cout << "-export_csv" << endl;
212 }
213 if (f_export_graphviz) {
214 cout << "-export_graphviz" << endl;
215 }
216 if (f_print) {
217 cout << "-print" << endl;
218 }
219 if (f_sort_by_colors) {
220 cout << "-sort_by_colors " << endl;
221 }
222 if (f_split) {
223 cout << "-split " << split_input_fname << " " << split_by_file << endl;
224 }
226 cout << "-split_by_starters " << split_by_starters_fname_reps << " " << split_by_starters_col_label << endl;
227 }
228 if (f_split_by_clique) {
229 cout << "-split_by_clique " << split_by_clique_label << " " << split_by_clique_set << endl;
230 }
231 if (f_save) {
232 cout << "-save " << endl;
233 }
235 cout << "-automorphism_group " << endl;
236 }
237 if (f_properties) {
238 cout << "-properties " << endl;
239 }
240 if (f_eigenvalues) {
241 cout << "-eigenvalues " << endl;
242 }
243 if (f_draw) {
244 cout << "-draw " << endl;
245 }
246}
247
248
249}}}
250
functions related to strings and character arrays
parameters that control the clique finding process
Definition: graph_theory.h:32
#define NEW_OBJECT(type)
Definition: foundations.h:638
#define TRUE
Definition: foundations.h:231
#define FALSE
Definition: foundations.h:234
the orbiter library for the classification of combinatorial objects