Gecode::Int::BinPacking::ConflictGraph::NodeSet Class Reference
Sets of graph nodes. More...
#include <bin-packing.hh>
Public Member Functions | |
| NodeSet (void) | |
| Keep uninitialized. | |
| NodeSet (Region &r, int n) | |
| Initialize node set for n nodes. | |
| NodeSet (Region &r, int n, const NodeSet &ns) | |
| Initialize node set as copy of ns with n nodes. | |
| void | allocate (Region &r, int n) |
| Allocate node set for n nodes. | |
| void | init (Region &r, int n) |
| Initialize node set for n nodes. | |
| bool | in (int i) const |
| Test whether node i is included. | |
| void | incl (int i) |
| Include node i. | |
| void | excl (int i) |
| Exclude node i. | |
| void | copy (int n, const NodeSet &ns) |
| Copy elements from node set ns with n nodes. | |
| void | empty (int n) |
| Clear the whole node set for n nodes. | |
Static Public Member Functions | |
| static bool | iwn (NodeSet &iwa, const NodeSet &a, NodeSet &iwb, const NodeSet &b, const NodeSet &c, int n) |
Detailed Description
Sets of graph nodes.
Definition at line 194 of file bin-packing.hh.
Constructor & Destructor Documentation
| Gecode::Int::BinPacking::ConflictGraph::NodeSet::NodeSet | ( | void | ) | [inline] |
Keep uninitialized.
Definition at line 47 of file conflict-graph.hpp.
| Gecode::Int::BinPacking::ConflictGraph::NodeSet::NodeSet | ( | Region & | r, | |
| int | n | |||
| ) | [inline] |
Initialize node set for n nodes.
Definition at line 49 of file conflict-graph.hpp.
| Gecode::Int::BinPacking::ConflictGraph::NodeSet::NodeSet | ( | Region & | r, | |
| int | n, | |||
| const NodeSet & | ns | |||
| ) | [inline] |
Initialize node set as copy of ns with n nodes.
Definition at line 52 of file conflict-graph.hpp.
Member Function Documentation
| void Gecode::Int::BinPacking::ConflictGraph::NodeSet::allocate | ( | Region & | r, | |
| int | n | |||
| ) | [inline] |
Allocate node set for n nodes.
Definition at line 56 of file conflict-graph.hpp.
| void Gecode::Int::BinPacking::ConflictGraph::NodeSet::init | ( | Region & | r, | |
| int | n | |||
| ) | [inline] |
Initialize node set for n nodes.
Definition at line 60 of file conflict-graph.hpp.
| bool Gecode::Int::BinPacking::ConflictGraph::NodeSet::in | ( | int | i | ) | const [inline] |
Test whether node i is included.
Definition at line 64 of file conflict-graph.hpp.
| void Gecode::Int::BinPacking::ConflictGraph::NodeSet::incl | ( | int | i | ) | [inline] |
Include node i.
Definition at line 68 of file conflict-graph.hpp.
| void Gecode::Int::BinPacking::ConflictGraph::NodeSet::excl | ( | int | i | ) | [inline] |
Exclude node i.
Definition at line 72 of file conflict-graph.hpp.
| void Gecode::Int::BinPacking::ConflictGraph::NodeSet::copy | ( | int | n, | |
| const NodeSet & | ns | |||
| ) | [inline] |
Copy elements from node set ns with n nodes.
Definition at line 76 of file conflict-graph.hpp.
| void Gecode::Int::BinPacking::ConflictGraph::NodeSet::empty | ( | int | n | ) | [inline] |
Clear the whole node set for n nodes.
Definition at line 80 of file conflict-graph.hpp.
| bool Gecode::Int::BinPacking::ConflictGraph::NodeSet::iwn | ( | NodeSet & | iwa, | |
| const NodeSet & | a, | |||
| NodeSet & | iwb, | |||
| const NodeSet & | b, | |||
| const NodeSet & | c, | |||
| int | n | |||
| ) | [inline, static] |
Initialize ac as intersection of a and c, bc as intersection of b and c where n is the maximal number of nodes. Return whether both and bc are empty.
Definition at line 84 of file conflict-graph.hpp.
The documentation for this class was generated from the following files:
- gecode/int/bin-packing.hh
- gecode/int/bin-packing/conflict-graph.hpp