Detailed Description
template<class T>
class gcg::BipartiteGraph< T >
Definition at line 44 of file bipartitegraph.h.
#include <bipartitegraph.h>
Public Member Functions | |
BipartiteGraph (SCIP *scip, Weights w) | |
virtual | ~BipartiteGraph () |
virtual SCIP_RETCODE | createFromMatrix (SCIP_CONS **conss, SCIP_VAR **vars, int nconss_, int nvars_) |
virtual SCIP_RETCODE | createFromPartialMatrix (DETPROBDATA *detprobdata, PARTIALDECOMP *partialdec) |
int | getNConsNodes () |
int | getNVarNodes () |
Public Member Functions inherited from gcg::MatrixGraph< T > | |
MatrixGraph (SCIP *scip, Weights w) | |
virtual | ~MatrixGraph () |
virtual SCIP_RETCODE | writeToFile (int fd, SCIP_Bool writeweights) |
virtual SCIP_RETCODE | createDecompFromPartition (DEC_DECOMP **decomp) |
virtual SCIP_RETCODE | createPartialdecFromPartition (PARTIALDECOMP *oldpartialdec, PARTIALDECOMP **firstpartialdec, PARTIALDECOMP **secondpartialdec, DETPROBDATA *detprobdata) |
virtual SCIP_RETCODE | readPartition (const char *filename) |
void | setDummynodes (int dummynodes_) |
int | getDummynodes () const |
virtual std::vector< int > | getPartition () |
virtual int | getNNonzeroes () const |
Additional Inherited Members | |
Data Fields inherited from gcg::MatrixGraph< T > | |
std::string | name |
Protected Attributes inherited from gcg::MatrixGraph< T > | |
SCIP * | scip_ |
int | nconss |
int | nvars |
int | dummynodes |
Weights | weights |
GraphInterface * | graphiface |
int | nnonzeroes |
Constructor & Destructor Documentation
◆ BipartiteGraph()
gcg::BipartiteGraph< T >::BipartiteGraph | ( | SCIP * | scip, |
Weights | w | ||
) |
- Parameters
-
scip SCIP data structure w weights for the given graph
Definition at line 44 of file bipartitegraph_def.h.
References gcg::MatrixGraph< T >::graphiface, and gcg::MatrixGraph< T >::name.
◆ ~BipartiteGraph()
|
virtual |
Definition at line 54 of file bipartitegraph_def.h.
Member Function Documentation
◆ createFromMatrix()
|
virtual |
Builds a bipartite graph structure out of the matrix.
The function will create an node for every constraint and every variable. A constraint and a variable are adjacent if the variable appears in the constraint variable array.
- Parameters
-
conss constraints for which graph should be created vars variables for which graph should be created nconss_ number of constraints nvars_ number of variables
Reimplemented from gcg::MatrixGraph< T >.
Definition at line 69 of file bipartitegraph_def.h.
References GCGisVarRelevant().
◆ createFromPartialMatrix()
|
virtual |
creates a graph with open constraints and open variables of the partialdec
Reimplemented from gcg::MatrixGraph< T >.
Definition at line 151 of file bipartitegraph_def.h.
References gcg::DETPROBDATA::getCons(), gcg::PARTIALDECOMP::getNConss(), gcg::PARTIALDECOMP::getNOpenconss(), gcg::PARTIALDECOMP::getNOpenvars(), gcg::PARTIALDECOMP::getNVars(), gcg::DETPROBDATA::getNVarsForCons(), gcg::PARTIALDECOMP::getOpenconss(), gcg::PARTIALDECOMP::getOpenvars(), gcg::DETPROBDATA::getVar(), and gcg::DETPROBDATA::getVarsForCons().
◆ getNConsNodes()
int gcg::BipartiteGraph< T >::getNConsNodes |
Definition at line 245 of file bipartitegraph_def.h.
◆ getNVarNodes()
int gcg::BipartiteGraph< T >::getNVarNodes |
Definition at line 251 of file bipartitegraph_def.h.