create_graph_description.cpp

Go to the documentation of this file.

/*
 * create_graph_description.cpp
 *
 *  Created on: Nov 28, 2019
 *      Author: betten
 */
 
 
 
 
#include "orbiter.h"
 
using namespace std;
 
namespace orbiter {
namespace layer5_applications {
namespace apps_graph_theory {
 
 
create_graph_description::create_graph_description()
{
    f_load = FALSE;
    //fname = NULL;
 
    f_Cayley_graph = FALSE;
    //std::string Cayley_graph_group;
    //std::string Cayley_graph_gens;
 
    f_load_csv_no_border = FALSE;
    f_load_dimacs = FALSE;
 
    f_edge_list = FALSE;
    n = 0;
    //edge_list_text;
 
    f_edges_as_pairs = FALSE;
    //edges_as_pairs_text;
 
    f_cycle = FALSE;
    cycle_n = 0;
 
    f_Hamming = FALSE;
    Hamming_n = 0;
    Hamming_q = 0;
 
    f_Johnson = FALSE;
    Johnson_n = 0;
    Johnson_k = 0;
    Johnson_s = 0;
 
    f_Paley = FALSE;
    Paley_q = 0;
 
    f_Sarnak = FALSE;
    Sarnak_p = 0;
    Sarnak_q = 0;
 
    f_Schlaefli = FALSE;
    Schlaefli_q = 0;
 
    f_Shrikhande = FALSE;
 
    f_Winnie_Li = FALSE;
    Winnie_Li_q = 0;
    Winnie_Li_index = 0;
 
    f_Grassmann = FALSE;
    Grassmann_n = 0;
    Grassmann_k = 0;
    Grassmann_q = 0;
    Grassmann_r = 0;
 
    f_coll_orthogonal = FALSE;
    coll_orthogonal_epsilon = 0;
    coll_orthogonal_d = 0;
    coll_orthogonal_q = 0;
 
    f_trihedral_pair_disjointness_graph = FALSE;
 
    f_non_attacking_queens_graph = FALSE;
    non_attacking_queens_graph_n = 0;
 
    f_subset = FALSE;
    //std::string subset_label;
    //std::string subset_label_tex;
    //std::string subset_text;
 
    f_disjoint_sets_graph = FALSE;
    //std::string disjoint_sets_graph_fname;
 
    f_orbital_graph = FALSE;
    //std::string orbital_graph_group;
    orbital_graph_orbit_idx = 0;
 
    f_collinearity_graph = FALSE;
    //std::string collinearity_graph_matrix;
 
    f_chain_graph = FALSE;
    //std::string chain_graph_partition_1;
    //std::string chain_graph_partition_2;
 
}
 
 
int create_graph_description::read_arguments(
    int argc, std::string *argv,
    int verbose_level)
{
    int f_v = (verbose_level >= 1);
    int i;
    data_structures::string_tools ST;
 
    if (f_v) {
        cout << "create_graph_description::read_arguments" << endl;
    }
    for (i = 0; i < argc; i++) {
 
        graph_modification_description M;
 
        if (ST.stringcmp(argv[i], "-load") == 0) {
            f_load = TRUE;
            fname.assign(argv[++i]);
            if (f_v) {
                cout << "-load " << fname << endl;
            }
        }
 
        else if (ST.stringcmp(argv[i], "-Cayley_graph") == 0) {
            f_Cayley_graph = TRUE;
            Cayley_graph_group.assign(argv[++i]);
            Cayley_graph_gens.assign(argv[++i]);
            if (f_v) {
                cout << "-Cayley_graph " << Cayley_graph_group << " " << Cayley_graph_gens << endl;
            }
        }
 
        else if (ST.stringcmp(argv[i], "-load_csv_no_border") == 0) {
            f_load_csv_no_border = TRUE;
            fname.assign(argv[++i]);
            if (f_v) {
                cout << "-load_csv_no_border " << fname << endl;
            }
        }
 
        else if (ST.stringcmp(argv[i], "-load_dimacs") == 0) {
            f_load_dimacs = TRUE;
            fname.assign(argv[++i]);
            if (f_v) {
                cout << "-load_dimacs " << fname << endl;
            }
        }
 
        else if (ST.stringcmp(argv[i], "-edge_list") == 0) {
            f_edge_list = TRUE;
            n = ST.strtoi(argv[++i]);
            edge_list_text.assign(argv[++i]);
            if (f_v) {
                cout << "-edge_list " << n << " " << edge_list_text << endl;
            }
        }
        else if (ST.stringcmp(argv[i], "-edges_as_pairs") == 0) {
            f_edges_as_pairs = TRUE;
            n = ST.strtoi(argv[++i]);
            edges_as_pairs_text.assign(argv[++i]);
            if (f_v) {
                cout << "-edges_as_pairs " << n << " " << edges_as_pairs_text << endl;
            }
        }
        else if (ST.stringcmp(argv[i], "-cycle") == 0) {
            f_cycle = TRUE;
            cycle_n = ST.strtoi(argv[++i]);
            if (f_v) {
                cout << "-cycle " << cycle_n << endl;
            }
        }
        else if (ST.stringcmp(argv[i], "-Hamming") == 0) {
            f_Hamming = TRUE;
            Hamming_n = ST.strtoi(argv[++i]);
            Hamming_q = ST.strtoi(argv[++i]);
            if (f_v) {
                cout << "-Hamming " << Hamming_n << " " << Hamming_q << endl;
            }
        }
        else if (ST.stringcmp(argv[i], "-Johnson") == 0) {
            f_Johnson = TRUE;
            Johnson_n = ST.strtoi(argv[++i]);
            Johnson_k = ST.strtoi(argv[++i]);
            Johnson_s = ST.strtoi(argv[++i]);
            if (f_v) {
                cout << "-Johnson " << Johnson_n << " " << Johnson_k << " " << Johnson_s << endl;
            }
        }
        else if (ST.stringcmp(argv[i], "-Paley") == 0) {
            f_Paley = TRUE;
            Paley_q = ST.strtoi(argv[++i]);
            if (f_v) {
                cout << "-Paley " << Paley_q << endl;
            }
        }
        else if (ST.stringcmp(argv[i], "-Sarnak") == 0) {
            f_Sarnak = TRUE;
            Sarnak_p = ST.strtoi(argv[++i]);
            Sarnak_q = ST.strtoi(argv[++i]);
            if (f_v) {
                cout << "-Sarnak " << Sarnak_p << " " << Sarnak_q << endl;
            }
        }
        else if (ST.stringcmp(argv[i], "-Schlaefli") == 0) {
            f_Schlaefli = TRUE;
            Schlaefli_q = ST.strtoi(argv[++i]);
            if (f_v) {
                cout << "-Schlaefli " << Schlaefli_q << endl;
            }
        }
        else if (ST.stringcmp(argv[i], "-Shrikhande") == 0) {
            f_Shrikhande = TRUE;
            if (f_v) {
                cout << "-Shrikhande " << endl;
            }
        }
        else if (ST.stringcmp(argv[i], "-Winnie_Li") == 0) {
            f_Winnie_Li = TRUE;
            Winnie_Li_q = ST.strtoi(argv[++i]);
            Winnie_Li_index = ST.strtoi(argv[++i]);
            if (f_v) {
                cout << "-Winnie_Li " << Winnie_Li_q << " " << Winnie_Li_index << endl;
            }
        }
        else if (ST.stringcmp(argv[i], "-Grassmann") == 0) {
            f_Grassmann = TRUE;
            Grassmann_n = ST.strtoi(argv[++i]);
            Grassmann_k = ST.strtoi(argv[++i]);
            Grassmann_q = ST.strtoi(argv[++i]);
            Grassmann_r = ST.strtoi(argv[++i]);
            if (f_v) {
                cout << "-Grassmann " << Grassmann_n << " " << Grassmann_k
                    << " " << Grassmann_q << " " << Grassmann_r << endl;
            }
        }
        else if (ST.stringcmp(argv[i], "-coll_orthogonal") == 0) {
            f_coll_orthogonal = TRUE;
            coll_orthogonal_epsilon = ST.strtoi(argv[++i]);
            coll_orthogonal_d = ST.strtoi(argv[++i]);
            coll_orthogonal_q = ST.strtoi(argv[++i]);
            if (f_v) {
                cout << "-coll_orthogonal " << coll_orthogonal_epsilon
                    << " " << coll_orthogonal_d
                    << " " << coll_orthogonal_q << endl;
            }
        }
        else if (ST.stringcmp(argv[i], "-trihedral_pair_disjointness_graph") == 0) {
            f_trihedral_pair_disjointness_graph = TRUE;
            if (f_v) {
                cout << "-trihedral_pair_disjointness_graph " << endl;
            }
        }
        else if (ST.stringcmp(argv[i], "-non_attacking_queens_graph") == 0) {
            f_non_attacking_queens_graph = TRUE;
            non_attacking_queens_graph_n = ST.strtoi(argv[++i]);
            if (f_v) {
                cout << "-non_attacking_queens_graph " << non_attacking_queens_graph_n << endl;
            }
        }
        else if (ST.stringcmp(argv[i], "-subset") == 0) {
            f_subset = TRUE;
            subset_label.assign(argv[++i]);
            subset_label_tex.assign(argv[++i]);
            subset_text.assign(argv[++i]);
            if (f_v) {
                cout << "-subset " << subset_label << " " << subset_label_tex << " " << subset_text << endl;
            }
        }
        else if (ST.stringcmp(argv[i], "-disjoint_sets_graph") == 0) {
            f_disjoint_sets_graph = TRUE;
            disjoint_sets_graph_fname.assign(argv[++i]);
            if (f_v) {
                cout << "-disjoint_sets_graph " << disjoint_sets_graph_fname << endl;
            }
        }
        else if (ST.stringcmp(argv[i], "-orbital_graph") == 0) {
            f_orbital_graph = TRUE;
            orbital_graph_group.assign(argv[++i]);
            orbital_graph_orbit_idx = ST.strtoi(argv[++i]);
            if (f_v) {
                cout << "-orbital_graph " << orbital_graph_group << " " << orbital_graph_orbit_idx << endl;
            }
        }
        else if (ST.stringcmp(argv[i], "-collinearity_graph") == 0) {
            f_collinearity_graph = TRUE;
            collinearity_graph_matrix.assign(argv[++i]);
            if (f_v) {
                cout << "-collinearity_graph "
                        << collinearity_graph_matrix << endl;
            }
        }
        else if (ST.stringcmp(argv[i], "-chain_graph") == 0) {
            f_chain_graph = TRUE;
            chain_graph_partition_1.assign(argv[++i]);
            chain_graph_partition_2.assign(argv[++i]);
            if (f_v) {
                cout << "-chain_graph "
                        << " " << chain_graph_partition_1
                        << " " << chain_graph_partition_2
                        << endl;
            }
        }
 
        else if (M.check_and_parse_argument(
                argc, i, argv,
                verbose_level)) {
            Modifications.push_back(M);
        }
 
        if (ST.stringcmp(argv[i], "-end") == 0) {
            if (f_v) {
                cout << "-end" << endl;
            }
            break;
        }
        else {
            cout << "create_graph_description::read_arguments "
                    "unrecognized option " << argv[i] << endl;
        }
    } // next i
    if (f_v) {
        cout << "create_graph_description::read_arguments done" << endl;
    }
    return i + 1;
}
 
void create_graph_description::print()
{
    if (f_load) {
        cout << "-load " << fname << endl;
    }
    if (f_Cayley_graph) {
        cout << "-Cayley_graph " << Cayley_graph_group << " " << Cayley_graph_gens << endl;
    }
    if (f_load_csv_no_border) {
        cout << "-load_csv_no_border " << fname << endl;
    }
    if (f_load_dimacs) {
        cout << "-load_dimacs " << fname << endl;
    }
    if (f_edge_list) {
        cout << "-edge_list " << n << " " << edge_list_text << endl;
    }
    if (f_edges_as_pairs) {
        cout << "-edges_as_pairs " << n << " " << edges_as_pairs_text << endl;
    }
    if (f_cycle) {
        cout << "-cycle " << cycle_n << endl;
    }
    if (f_Hamming) {
        cout << "-Hamming " << Hamming_n << " " << Hamming_q << endl;
    }
    if (f_Johnson) {
        cout << "-Johnson " << Johnson_n << " " << Johnson_k << " " << Johnson_s << endl;
    }
    if (f_Paley) {
        cout << "-Paley " << Paley_q << endl;
    }
    if (f_Sarnak) {
        cout << "-Sarnak " << Sarnak_p << " " << Sarnak_q << endl;
    }
    if (f_Schlaefli) {
        cout << "-Schlaefli " << Schlaefli_q << endl;
    }
    if (f_Shrikhande) {
        cout << "-Shrikhande " << endl;
    }
    if (f_Winnie_Li) {
        cout << "-Winnie_Li " << Winnie_Li_q << " " << Winnie_Li_index << endl;
    }
    if (f_Grassmann) {
        cout << "-Grassmann " << Grassmann_n << " " << Grassmann_k
                << " " << Grassmann_q << " " << Grassmann_r << endl;
    }
    if (f_coll_orthogonal) {
        cout << "-coll_orthogonal " << coll_orthogonal_epsilon
                << " " << coll_orthogonal_d
                << " " << coll_orthogonal_q << endl;
    }
    if (f_trihedral_pair_disjointness_graph) {
        cout << "-trihedral_pair_disjointness_graph " << endl;
    }
    if (f_non_attacking_queens_graph) {
        cout << "-non_attacking_queens_graph " << non_attacking_queens_graph_n << endl;
    }
    if (f_subset) {
        cout << "-subset " << subset_label << " " << subset_label_tex << " " << subset_text << endl;
    }
    if (f_orbital_graph) {
        cout << "-orbital_graph " << orbital_graph_group << " " << orbital_graph_orbit_idx << endl;
    }
    if (f_collinearity_graph) {
        cout << "-collinearity_graph "
                << collinearity_graph_matrix << endl;
    }
    if (f_chain_graph) {
        cout << "-chain_graph "
                << " " << chain_graph_partition_1
                << " " << chain_graph_partition_2
                << endl;
    }
 
    int i;
 
    for (i = 0; i < Modifications.size(); i++) {
        Modifications[i].print();
    }
}
 
 
 
 
}}}