CglClique::frac_graph Struct Reference

A graph corresponding to a fractional solution of an LP. More...

Collaboration diagram for CglClique::frac_graph:
Collaboration graph
[legend]

List of all members.

Public Member Functions

 frac_graph ()

Public Attributes

int nodenum
 # of nodes = # of fractional values in the LP solution
int edgenum
 # of edges in the graph
double density
 density= edgenum/(nodenum choose 2)
int min_deg_node
int min_degree
int max_deg_node
int max_degree
fnodenodes
 The array of the nodes in the graph.
int * all_nbr
 The array of all the neighbors.
double * all_edgecost
 The array of the costs of the edges going to the neighbors.

Detailed Description

A graph corresponding to a fractional solution of an LP.

Two nodes are adjacent iff their columns are non-orthogonal.

Definition at line 106 of file CglClique.hpp.


Constructor & Destructor Documentation

CglClique::frac_graph::frac_graph (  )  [inline]

Definition at line 125 of file CglClique.hpp.


Member Data Documentation

# of nodes = # of fractional values in the LP solution

Definition at line 108 of file CglClique.hpp.

# of edges in the graph

Definition at line 110 of file CglClique.hpp.

density= edgenum/(nodenum choose 2)

Definition at line 112 of file CglClique.hpp.

Definition at line 113 of file CglClique.hpp.

Definition at line 114 of file CglClique.hpp.

Definition at line 115 of file CglClique.hpp.

Definition at line 116 of file CglClique.hpp.

The array of the nodes in the graph.

Definition at line 118 of file CglClique.hpp.

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 121 of file CglClique.hpp.

The array of the costs of the edges going to the neighbors.

Definition at line 123 of file CglClique.hpp.


The documentation for this struct was generated from the following file:

Generated on 15 Mar 2015 for Coin-All by  doxygen 1.6.1