columngraph_def.h
Go to the documentation of this file.
29 * @brief A row graph where each column is a node and columns are adjacent if they appear in one row
34 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
91 /* first, make sure that there are constraints in every block, otherwise the hole thing is useless */
104 SCIP_CALL( DECfilloutDecompFromConstoblock(this->scip_, *decomp, constoblock, nblocks, FALSE) );
Definition: struct_decomp.h:51
Definition: class_conspartition.cpp:43
Definition: weights.h:41
static SCIP_RETCODE partition(SCIP *scip, SCIP_VAR **J, int *Jsize, SCIP_Longint *priority, SCIP_VAR **F, int Fsize, SCIP_VAR **origvar, SCIP_Real *median)
Definition: branch_generic.c:832
SCIP_RETCODE DECfilloutDecompFromConstoblock(SCIP *scip, DEC_DECOMP *decomp, SCIP_HASHMAP *constoblock, int nblocks, SCIP_Bool staircase)
Definition: decomp.c:1455
A row graph where each column is a node and columns are adjacent if they appear in a row.
virtual SCIP_RETCODE createFromMatrix(SCIP_CONS **conss, SCIP_VAR **vars, int nconss_, int nvars_)
Definition: columngraph_def.h:117
Definition: matrixgraph.h:54
SCIP_RETCODE DECdecompCreate(SCIP *scip, DEC_DECOMP **decdecomp)
Definition: decomp.c:471
virtual SCIP_RETCODE createDecompFromPartition(DEC_DECOMP **decomp)
Definition: columngraph_def.h:63