SCIP
Solving Constraint Integer Programs
Solving Constraint Integer Programs
variable graph data structure to determine breadth-first distances between variables
the variable graph internally stores a mapping from the variables to the constraints in which they appear.
Definition at line 97 of file heur_gins.c.
Data Fields | |
| SCIP_CONS *** | varconss |
| SCIP_HASHTABLE * | visitedconss |
| int * | nvarconss |
| int * | varconssize |
| SCIP_CONS*** VariableGraph::varconss |
constraints of each variable
Definition at line 99 of file heur_gins.c.
Referenced by fillVariableGraph(), and variablegraphBreadthFirst().
| SCIP_HASHTABLE* VariableGraph::visitedconss |
hash table that keeps a record of visited constraints during breadth-first search
Definition at line 100 of file heur_gins.c.
Referenced by variablegraphBreadthFirst().
| int* VariableGraph::nvarconss |
number of constraints for each variable
Definition at line 101 of file heur_gins.c.
Referenced by fillVariableGraph(), and variablegraphBreadthFirst().
| int* VariableGraph::varconssize |
size array for every varconss entry
Definition at line 102 of file heur_gins.c.
Referenced by fillVariableGraph().