#include <VrpNetwork.h>
Collaboration diagram for VrpNetwork:
Public Member Functions | |
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 () |
Private Attributes | |
int | edgenum_ |
int | maxEdgenum_ |
int | vertnum_ |
bool | isIntegral_ |
int | numComps_ |
EDGE * | edges_ |
VERTEX * | verts_ |
double | mincut_ |
ELIST * | adjList_ |
int * | compNodes_ |
int * | compDemands_ |
double * | compCuts_ |
int * | compMembers_ |
int * | newDemand_ |
Friends | |
class | VrpModel |
class | VrpCutGenerator |
class | VrpSolution |
Definition at line 80 of file VrpNetwork.h.
VrpNetwork::VrpNetwork | ( | ) | [inline] |
Definition at line 108 of file VrpNetwork.h.
References adjList_, compCuts_, compDemands_, compMembers_, compNodes_, edges_, newDemand_, and verts_.
VrpNetwork::VrpNetwork | ( | int | edgenum, | |
int | vertnum | |||
) |
virtual VrpNetwork::~VrpNetwork | ( | ) | [inline, virtual] |
void VrpNetwork::createNet | ( | CoinPackedVector * | sol, | |
int * | demand, | |||
std::vector< VrpVariable * > | edgeList, | |||
double | etol, | |||
int | vertnum | |||
) |
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 | ( | ) |
Referenced by ~VrpNetwork().
friend class VrpModel [friend] |
Definition at line 82 of file VrpNetwork.h.
friend class VrpCutGenerator [friend] |
Definition at line 83 of file VrpNetwork.h.
friend class VrpSolution [friend] |
Definition at line 84 of file VrpNetwork.h.
int VrpNetwork::edgenum_ [private] |
Definition at line 88 of file VrpNetwork.h.
int VrpNetwork::maxEdgenum_ [private] |
Definition at line 89 of file VrpNetwork.h.
int VrpNetwork::vertnum_ [private] |
Definition at line 90 of file VrpNetwork.h.
bool VrpNetwork::isIntegral_ [private] |
Definition at line 91 of file VrpNetwork.h.
int VrpNetwork::numComps_ [private] |
Definition at line 93 of file VrpNetwork.h.
struct EDGE* VrpNetwork::edges_ [private] |
struct VERTEX* VrpNetwork::verts_ [private] |
double VrpNetwork::mincut_ [private] |
Definition at line 96 of file VrpNetwork.h.
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] |