A graph corresponding to a fractional solution of an LP. More...
Public Member Functions | |
frac_graph () | |
Public Attributes | |
int | nodenum |
of nodes = # of fractional values in the LP solutionMore... | |
int | edgenum |
of edges in the graphMore... | |
double | density |
density= edgenum/(nodenum choose 2) More... | |
int | min_deg_node |
int | min_degree |
int | max_deg_node |
int | max_degree |
fnode * | nodes |
The array of the nodes in the graph. More... | |
int * | all_nbr |
The array of all the neighbors. More... | |
double * | all_edgecost |
The array of the costs of the edges going to the neighbors. More... | |
A graph corresponding to a fractional solution of an LP.
Two nodes are adjacent iff their columns are non-orthogonal.
Definition at line 111 of file CglClique.hpp.
|
inline |
Definition at line 130 of file CglClique.hpp.
int CglClique::frac_graph::nodenum |
Definition at line 113 of file CglClique.hpp.
int CglClique::frac_graph::edgenum |
Definition at line 115 of file CglClique.hpp.
double CglClique::frac_graph::density |
density= edgenum/(nodenum choose 2)
Definition at line 117 of file CglClique.hpp.
int CglClique::frac_graph::min_deg_node |
Definition at line 118 of file CglClique.hpp.
int CglClique::frac_graph::min_degree |
Definition at line 119 of file CglClique.hpp.
int CglClique::frac_graph::max_deg_node |
Definition at line 120 of file CglClique.hpp.
int CglClique::frac_graph::max_degree |
Definition at line 121 of file CglClique.hpp.
fnode* CglClique::frac_graph::nodes |
The array of the nodes in the graph.
Definition at line 123 of file CglClique.hpp.
int* CglClique::frac_graph::all_nbr |
The array of all the neighbors.
First the indices of the nodes adjacent to node 0 are listed, then those adjacent to node 1, etc.
Definition at line 126 of file CglClique.hpp.
double* CglClique::frac_graph::all_edgecost |
The array of the costs of the edges going to the neighbors.
Definition at line 128 of file CglClique.hpp.