#include <stdio.h>#include <sym_proto.h>#include "spp_constants.h"#include "spp_types.h"#include "spp_cg_params.h"
Include dependency graph for spp_cg.h:
Go to the source code of this file.
Classes | |
| struct | FNODE |
| struct | FRAC_GRAPH |
| struct | LEVEL_GRAPH |
| struct | CUT_COLLECTION |
| struct | SPP_CG_TMP |
| struct | SPP_CG_PROBLEM |
Typedefs | |
| typedef struct FNODE | fnode |
| typedef struct FRAC_GRAPH | frac_graph |
| typedef struct LEVEL_GRAPH | level_graph |
| typedef struct CUT_COLLECTION | cut_collection |
| typedef struct SPP_CG_TMP | spp_cg_tmp |
| typedef struct SPP_CG_PROBLEM | spp_cg_problem |
Functions | |
| void allocate_var_length_structures | PROTO ((spp_cg_problem *spp, int max_ln)) |
| void free_var_length_structures | PROTO ((spp_cg_problem *spp)) |
| void construct_fractional_graph | PROTO ((spp_cg_problem *spp, int number, int *indices, double *values)) |
| void construct_complement_graph | PROTO ((frac_graph *fgraph, frac_graph *cfgraph)) |
| void construct_level_graph | PROTO ((frac_graph *fgraph, int root, level_graph *lgraph)) |
| int register_and_send_cut | PROTO ((spp_cg_problem *spp, cut_data *new_cut, double violation, double etol)) |
| void extend_clique_on_fgraph | PROTO ((spp_cg_problem *spp, cut_data *new_cut, double *pviolation)) |
| void translate_cut_to_indices | PROTO ((spp_cg_problem *spp, cut_data *cut)) |
| void rotate_odd_hole | PROTO ((int length, int *indices, int *itmp)) |
| int enumerate_maximal_cliques | PROTO ((spp_cg_problem *spp, int pos, double etol)) |
| void spp_delete_node | PROTO ((spp_cg_problem *spp, int del_ind, int *pcurrent_nodenum, int *current_indices, int *current_degrees, double *current_values)) |
| int choose_next_node | PROTO ((spp_cg_problem *spp, int current_nodenum, int *current_indices, int *current_degrees, double *current_values)) |
| int find_violated_star_cliques | PROTO ((spp_cg_problem *spp, double etol)) |
| int greedy_maximal_clique | PROTO ((spp_cg_problem *spp, cut_data *new_cut, int length, int *indices, int pos, double etol)) |
| double find_chordless_oh | PROTO ((spp_cg_problem *spp, frac_graph *fgraph, int u, int w, int *oh)) |
| void min_path_to_root | PROTO ((spp_cg_problem *spp, frac_graph *fgraph, int u, int *path_u, double *pcost)) |
| double lift_nonviolated_odd_hole | PROTO ((spp_cg_problem *spp, int oh_len, int *oh, double lhs_oh, int *phub_len, int *hubs, int *hub_coef)) |
| int max_lhs_of_lifted_odd_hole | PROTO ((spp_cg_problem *spp, int oh_len, int *oh, int hub, int hub_len, int *hubs, int *hub_coef, char *label, int pos)) |
| double lift_nonviolated_odd_antihole | PROTO ((spp_cg_problem *spp, int oah_len, int *oah, double lhs_oah, int *phub_len, int *hubs, int *hub_coef, double etol)) |
Typedef Documentation
| typedef struct FRAC_GRAPH frac_graph |
Definition at line 94 of file CglClique.hpp.
| typedef struct LEVEL_GRAPH level_graph |
| typedef struct CUT_COLLECTION cut_collection |
| typedef struct SPP_CG_TMP spp_cg_tmp |
| typedef struct SPP_CG_PROBLEM spp_cg_problem |
Function Documentation
| void allocate_var_length_structures PROTO | ( | (spp_cg_problem *spp, int max_ln) | ) |
| void construct_rm_frac PROTO | ( | (spp_cg_problem *spp) | ) |
| void construct_fractional_graph PROTO | ( | (spp_cg_problem *spp, int number, int *indices, double *values) | ) |
| void construct_complement_graph PROTO | ( | (frac_graph *fgraph, frac_graph *cfgraph) | ) |
| void construct_level_graph PROTO | ( | (frac_graph *fgraph, int root, level_graph *lgraph) | ) |
| int register_and_send_cut PROTO | ( | (spp_cg_problem *spp, cut_data *new_cut, double violation, double etol) | ) |
| void extend_clique_on_fgraph PROTO | ( | (spp_cg_problem *spp, cut_data *new_cut, double *pviolation) | ) |
| void translate_cut_to_indices PROTO | ( | (spp_cg_problem *spp, cut_data *cut) | ) |
| void rotate_odd_hole PROTO | ( | (int length, int *indices, int *itmp) | ) |
| int enumerate_maximal_cliques PROTO | ( | (spp_cg_problem *spp, int pos, double etol) | ) |
| void spp_delete_node PROTO | ( | (spp_cg_problem *spp, int del_ind, int *pcurrent_nodenum, int *current_indices, int *current_degrees, double *current_values) | ) |
| int choose_next_node PROTO | ( | (spp_cg_problem *spp, int current_nodenum, int *current_indices, int *current_degrees, double *current_values) | ) |
| int find_violated_odd_antiholes PROTO | ( | (spp_cg_problem *spp, double etol) | ) |
| int greedy_maximal_clique PROTO | ( | (spp_cg_problem *spp, cut_data *new_cut, int length, int *indices, int pos, double etol) | ) |
| double find_chordless_oh PROTO | ( | (spp_cg_problem *spp, frac_graph *fgraph, int u, int w, int *oh) | ) |
| void min_path_to_root PROTO | ( | (spp_cg_problem *spp, frac_graph *fgraph, int u, int *path_u, double *pcost) | ) |
| double lift_nonviolated_odd_hole PROTO | ( | (spp_cg_problem *spp, int oh_len, int *oh, double lhs_oh, int *phub_len, int *hubs, int *hub_coef) | ) |
| int max_lhs_of_lifted_odd_hole PROTO | ( | (spp_cg_problem *spp, int oh_len, int *oh, int hub, int hub_len, int *hubs, int *hub_coef, char *label, int pos) | ) |
| double lift_nonviolated_odd_antihole PROTO | ( | (spp_cg_problem *spp, int oah_len, int *oah, double lhs_oah, int *phub_len, int *hubs, int *hub_coef, double etol) | ) |
