tclique_coloring.h
Go to the documentation of this file.
33/*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
66/** colors the positive weighted nodes of a given set of nodes V with the lowest possible number of colors and
67 * finds a clique in the graph induced by V, an upper bound and an apriori bound for further branching steps */
memory allocation routines
tclique user interface
struct _LIST_ITV LIST_ITV
TCLIQUE_WEIGHT tcliqueColoring(TCLIQUE_GETNNODES((*getnnodes)), TCLIQUE_GETWEIGHTS((*getweights)), TCLIQUE_SELECTADJNODES((*selectadjnodes)), TCLIQUE_GRAPH *tcliquegraph, BMS_CHKMEM *mem, int *buffer, int *V, int nV, NBC *gsd, TCLIQUE_Bool *iscolored, TCLIQUE_WEIGHT *apbound, int *clique, int *nclique, TCLIQUE_WEIGHT *weightclique)
Definition: tclique_coloring.c:230
struct _ITV ITV
struct _NBC NBC