#include <VrpNetwork.h>
|
| | VrpNetwork () |
| |
| | VrpNetwork (int edgenum, int vertnum) |
| |
| virtual | ~VrpNetwork () |
| |
| void | createNet (CoinPackedVector *sol, int *demand, std::vector< VrpVariable * > edgeList, double etol, int vertnum) |
| |
| void | computeCompNums (vertex *v, int parent_comp, int *num_comps, bool parent_is_art_point) |
| |
| void | depthFirstSearch (vertex *v, int *count1, int *count2) |
| |
| int | connected () |
| |
| int | biconnected () |
| |
| void | reduce_graph (double etol) |
| |
| void | gutsOfDestructor () |
| |
Definition at line 80 of file VrpNetwork.h.
| VrpNetwork::VrpNetwork |
( |
| ) |
|
|
inline |
| VrpNetwork::VrpNetwork |
( |
int |
edgenum, |
|
|
int |
vertnum |
|
) |
| |
| virtual VrpNetwork::~VrpNetwork |
( |
| ) |
|
|
inlinevirtual |
| void VrpNetwork::computeCompNums |
( |
vertex * |
v, |
|
|
int |
parent_comp, |
|
|
int * |
num_comps, |
|
|
bool |
parent_is_art_point |
|
) |
| |
| void VrpNetwork::depthFirstSearch |
( |
vertex * |
v, |
|
|
int * |
count1, |
|
|
int * |
count2 |
|
) |
| |
| int VrpNetwork::connected |
( |
| ) |
|
| int VrpNetwork::biconnected |
( |
| ) |
|
| void VrpNetwork::reduce_graph |
( |
double |
etol | ) |
|
| void VrpNetwork::gutsOfDestructor |
( |
| ) |
|
| int VrpNetwork::maxEdgenum_ |
|
private |
| bool VrpNetwork::isIntegral_ |
|
private |
| int VrpNetwork::numComps_ |
|
private |
| struct EDGE* VrpNetwork::edges_ |
|
private |
| struct VERTEX* VrpNetwork::verts_ |
|
private |
| double VrpNetwork::mincut_ |
|
private |
| struct ELIST* VrpNetwork::adjList_ |
|
private |
| int* VrpNetwork::compNodes_ |
|
private |
| int* VrpNetwork::compDemands_ |
|
private |
| double* VrpNetwork::compCuts_ |
|
private |
| int* VrpNetwork::compMembers_ |
|
private |
| int* VrpNetwork::newDemand_ |
|
private |
The documentation for this class was generated from the following file:
- /home/coin/svn-release/Blis-0.94.3/Blis/examples/VRP/VrpNetwork.h