Graph Struct Reference

Detailed Description

graph structure, where

  • each vertex represents a constraint;
  • an edge between two vertices exists iff the constraints corresponding to the vertices have at least one variable in common;
  • the weight of an edge is equal to the number of these variables

Definition at line 113 of file dec_cutpacking.c.

Public Attributes

ADJLIST ** adjlists
 
SCIP_CONS ** conss
 
int nconss
 
SCIP_HASHMAP * constopos
 
int nedges
 
SCIP_CONS * cons1
 
SCIP_CONS * cons2
 

Member Data Documentation

ADJLIST** Graph::adjlists

adjacencylists of the graph

Definition at line 115 of file dec_cutpacking.c.

Referenced by allocateGraph(), applyStoerWagner(), buildGraphStructure(), buildNewAdjacencyList(), buildNewGraphs(), callMetis(), and freeGraph().

SCIP_CONS* Graph::cons1

first linking constraint

Definition at line 122 of file dec_cutpacking.c.

Referenced by applyStoerWagner(), buildGraphStructure(), buildNewGraphs(), and setLinkingCons().

SCIP_CONS* Graph::cons2

second linking constraint

Definition at line 123 of file dec_cutpacking.c.

Referenced by applyStoerWagner(), buildGraphStructure(), buildNewGraphs(), and setLinkingCons().

SCIP_CONS** Graph::conss

constraints (each constraint represents a vertex of the graph)

Definition at line 116 of file dec_cutpacking.c.

Referenced by allocateGraph(), applyStoerWagner(), buildGraphStructure(), buildNewAdjacencyList(), buildNewGraphs(), copyConss(), freeGraph(), initData(), and setLinkingCons().

SCIP_HASHMAP* Graph::constopos

assigns constraints to their position in conss

Definition at line 118 of file dec_cutpacking.c.

Referenced by allocateGraph(), applyStoerWagner(), buildGraphStructure(), buildNewAdjacencyList(), buildNewGraphs(), callMetis(), and freeGraph().

int Graph::nconss
int Graph::nedges

number of edges

Definition at line 120 of file dec_cutpacking.c.

Referenced by buildGraphStructure(), buildNewAdjacencyList(), and callMetis().