Detailed Description
undirected graph
Definition at line 79 of file GomoryHuTree.h.
#include <GomoryHuTree.h>
Data Fields | |
int | nuses |
int | nnodes |
int | nedges |
int | nedgesnonzero |
GRAPHNODE * | nodes |
GRAPHEDGE * | edges |
Field Documentation
◆ nuses
int Graph::nuses |
◆ nnodes
int Graph::nnodes |
number of nodes of the graph
Definition at line 82 of file GomoryHuTree.h.
Referenced by constructCutList(), constructSingleCut(), copy_graph(), findSubtour(), getToken(), ghc_tree(), global_relabel(), maxflow(), SCIP_DECL_CONSPRINT(), SCIP_DECL_EVENTEXEC(), and sepaSubtour().
◆ nedges
int Graph::nedges |
number of edges
Definition at line 83 of file GomoryHuTree.h.
Referenced by copy_graph(), maxflow(), tsp::ProbDataTSP::scip_copy(), SCIP_DECL_CONSLOCK(), SCIP_DECL_CONSPRINT(), tsp::ProbDataTSP::scip_trans(), and sepaSubtour().
◆ nedgesnonzero
int Graph::nedgesnonzero |
nonzero edges (not currently used)
Definition at line 84 of file GomoryHuTree.h.
Referenced by maxflow().
◆ nodes
GRAPHNODE* Graph::nodes |
array containing the nodes of the graph
Definition at line 86 of file GomoryHuTree.h.
Referenced by constructCutList(), constructSingleCut(), copy_graph(), findSubtour(), getToken(), ghc_tree(), global_relabel(), maxflow(), nodeOnRootPath(), SCIP_DECL_EVENTEXEC(), SCIP_DECL_READERREAD(), and sepaSubtour().
◆ edges
GRAPHEDGE* Graph::edges |
array containing all halfedges (thus, it's size is two times nedges)
Definition at line 87 of file GomoryHuTree.h.
Referenced by copy_graph(), maxflow(), tsp::ProbDataTSP::scip_copy(), SCIP_DECL_CONSLOCK(), SCIP_DECL_READERREAD(), tsp::ProbDataTSP::scip_trans(), and sepaSubtour().