16namespace layer5_applications {
17namespace apps_graph_theory {
34 int argc,
int &i, std::string *argv,
37 int f_v = (verbose_level >= 1);
41 cout <<
"graph_modification_description::check_and_parse_argument" << endl;
43 if (ST.
stringcmp(argv[i],
"-complement") == 0) {
47 cout <<
"-complement " << endl;
51 else if (ST.
stringcmp(argv[i],
"-distance_2") == 0) {
55 cout <<
"-distance_2 " << endl;
60 cout <<
"graph_modification_description::read_arguments done" << endl;
66 int argc, std::string *argv,
69 int f_v = (verbose_level >= 1);
74 cout <<
"graph_modification_description::read_arguments" << endl;
76 for (i = 0; i < argc; i++) {
78 if (ST.
stringcmp(argv[i],
"-complement") == 0) {
81 cout <<
"-complement " << endl;
85 else if (ST.
stringcmp(argv[i],
"-distance_2") == 0) {
88 cout <<
"-distance_2 " << endl;
92 else if (ST.
stringcmp(argv[i],
"-end") == 0) {
94 cout <<
"-end" << endl;
99 cout <<
"graph_modification_description::read_arguments "
100 "unrecognized option " << argv[i] << endl;
104 cout <<
"graph_modification_description::read_arguments done" << endl;
112 cout <<
"-complement " << endl;
115 cout <<
"-distance_2 " << endl;
121 int f_v = (verbose_level >= 1);
124 cout <<
"graph_modification_description::apply" << endl;
133 cout <<
"graph_modification_description::apply done" << endl;
a graph with a vertex coloring
void complement(int verbose_level)
void distance_2(int verbose_level)
graph_modification_description()
~graph_modification_description()
int read_arguments(int argc, std::string *argv, int verbose_level)
int check_and_parse_argument(int argc, int &i, std::string *argv, int verbose_level)
void apply(graph_theory::colored_graph *&CG, int verbose_level)
the orbiter library for the classification of combinatorial objects