Graph containing conflict information.
More...
#include <bin-packing.hh>
|
int | nodes (void) const |
| Return number of nodes.
|
|
Clique | cur |
| Current clique.
|
Clique | max |
| Largest clique so far.
|
ExecStatus | clique (void) |
| Report the current clique.
|
ExecStatus | clique (int i) |
| Found a clique of node i.
|
ExecStatus | clique (int i, int j) |
| Found a clique of nodes i and j.
|
ExecStatus | clique (int i, int j, int k) |
| Found a clique of nodes i, j, and k.
|
| ConflictGraph (Home &home, Region &r, const IntVarArgs &b, int m) |
| Initialize graph.
|
void | edge (int i, int j, bool add=true) |
| Add or remove an edge between nodes i and j (i must be less than j)
|
bool | adjacent (int i, int j) const |
| Test whether nodes i and j are adjacent.
|
ExecStatus | post (void) |
| Post additional constraints.
|
IntSet | maxclique (void) const |
| Return maximal clique found.
|
| ~ConflictGraph (void) |
| Destructor.
|
Graph containing conflict information.
Definition at line 182 of file bin-packing.hh.
◆ ConflictGraph()
Gecode::Int::BinPacking::ConflictGraph::ConflictGraph |
( |
Home & | home, |
|
|
Region & | r, |
|
|
const IntVarArgs & | b, |
|
|
int | m ) |
|
inline |
◆ ~ConflictGraph()
Gecode::Int::BinPacking::ConflictGraph::~ConflictGraph |
( |
void | | ) |
|
|
inline |
◆ nodes()
int Gecode::Int::BinPacking::ConflictGraph::nodes |
( |
void | | ) |
const |
|
inlineprotected |
◆ pivot()
int Gecode::Int::BinPacking::ConflictGraph::pivot |
( |
const NodeSet & | a, |
|
|
const NodeSet & | b ) const |
|
inlineprotected |
◆ bk()
Run Bosch-Kerbron algorithm for finding max cliques.
Definition at line 39 of file conflict-graph.cpp.
◆ clique() [1/4]
ExecStatus Gecode::Int::BinPacking::ConflictGraph::clique |
( |
void | | ) |
|
|
inlineprotected |
◆ clique() [2/4]
ExecStatus Gecode::Int::BinPacking::ConflictGraph::clique |
( |
int | i | ) |
|
|
inlineprotected |
◆ clique() [3/4]
ExecStatus Gecode::Int::BinPacking::ConflictGraph::clique |
( |
int | i, |
|
|
int | j ) |
|
inlineprotected |
◆ clique() [4/4]
ExecStatus Gecode::Int::BinPacking::ConflictGraph::clique |
( |
int | i, |
|
|
int | j, |
|
|
int | k ) |
|
inlineprotected |
◆ edge()
void Gecode::Int::BinPacking::ConflictGraph::edge |
( |
int | i, |
|
|
int | j, |
|
|
bool | add = true ) |
|
inline |
Add or remove an edge between nodes i and j (i must be less than j)
Definition at line 156 of file conflict-graph.hpp.
◆ adjacent()
bool Gecode::Int::BinPacking::ConflictGraph::adjacent |
( |
int | i, |
|
|
int | j ) const |
|
inline |
◆ post()
ExecStatus Gecode::Int::BinPacking::ConflictGraph::post |
( |
void | | ) |
|
|
inline |
◆ maxclique()
IntSet Gecode::Int::BinPacking::ConflictGraph::maxclique |
( |
void | | ) |
const |
|
inline |
◆ home
Home& Gecode::Int::BinPacking::ConflictGraph::home |
|
protected |
const IntVarArgs& Gecode::Int::BinPacking::ConflictGraph::b |
|
protected |
◆ bins
unsigned int Gecode::Int::BinPacking::ConflictGraph::bins |
|
protected |
◆ node
Node* Gecode::Int::BinPacking::ConflictGraph::node |
|
protected |
◆ cur
Clique Gecode::Int::BinPacking::ConflictGraph::cur |
|
protected |
◆ max
Clique Gecode::Int::BinPacking::ConflictGraph::max |
|
protected |
The documentation for this class was generated from the following files: