Gecode::Int::GCC::Edge Class Reference
Detailed Description
Class for edges
in the variable-value-graph.
Definition at line 310 of file graphsup.icc.
Constructors | |
| Edge (VarNode *x, ValNode *v) | |
Construct edge  from variable node x and value node y. | |
| void * | operator new (size_t, void *) |
| Create a new edge in memory. | |
Access | |
| template<BC > | |
| bool | used (void) |
| return whether the edge is used | |
| template<BC > | |
| bool | matched (void) |
| return whether the edge is matched | |
| bool | is_deleted (void) |
| return whether the edge has been deleted from the graph | |
| Edge * | next (bool t) const |
| return a pointer to the next edge If t is false the function returns the next edge incident on x otherwise it returns the next edge incident on v | |
| Edge * | next (void) const |
| return the pointer to the next edge incident on x | |
| Edge * | prev (void) const |
| return the pointer to the previous edge incident on x | |
| Edge * | vnext (void) const |
| return the pointer to the next edge incident on v | |
| Edge * | vprev (void) const |
| return the pointer to the previous edge incident on v | |
| VarNode * | getVar (void) |
| return the pointer to the variable node x of this edge | |
| ValNode * | getVal (void) |
| return the pointer to the value node v of this edge | |
| VVGNode * | getMate (bool t) |
| return pointer to x if t = true otherwise return v | |
| template<BC > | |
| void | use (void) |
| Update. | |
| template<BC > | |
| void | free (void) |
| Mark the edge as unused. | |
| template<BC > | |
| void | reset (void) |
| Reset the edge ( free the edge, and unmatch the edge including its end-nodes. | |
| template<BC > | |
| void | match (void) |
| Match the edge. | |
| template<BC > | |
| void | unmatch (void) |
| Unmatch the edge and the incident nodes. | |
| template<BC > | |
| void | unmatch (bool t) |
| Unmatch the edge and ( x if t=false, v otherwise ). | |
| void | unlink (void) |
| Unlink the edge from the linked list of edges. | |
| void | del_edge (void) |
| Mark the edge as deleted during synchronization. | |
| void | insert_edge (void) |
| Insert the edge again. | |
| Edge ** | next_ref (void) |
| return the reference to the next edge incident on x | |
| Edge ** | prev_ref (void) |
| return the reference to the previous edge incident on x | |
| Edge ** | vnext_ref (void) |
| return the reference to the next edge incident on v | |
| Edge ** | vprev_ref (void) |
| return the reference to the previous edge incident on v | |
Constructor & Destructor Documentation
Member Function Documentation
| void * Gecode::Int::GCC::Edge::operator new | ( | size_t | , | |
| void * | p | |||
| ) | [inline] |
| bool Gecode::Int::GCC::Edge::used | ( | void | ) | [inline] |
return whether the edge is used
An edge can be used in a matching on the graph, a path on the graph or a cycle in the graph.
Definition at line 1115 of file graphsup.icc.
| bool Gecode::Int::GCC::Edge::matched | ( | void | ) | [inline] |
| bool Gecode::Int::GCC::Edge::is_deleted | ( | void | ) | [inline] |
return whether the edge has been deleted from the graph
Definition at line 1259 of file graphsup.icc.
| Edge * Gecode::Int::GCC::Edge::next | ( | bool | t | ) | const [inline] |
return a pointer to the next edge If t is false the function returns the next edge incident on x otherwise it returns the next edge incident on v
Definition at line 1129 of file graphsup.icc.
| Edge * Gecode::Int::GCC::Edge::next | ( | void | ) | const [inline] |
| Edge * Gecode::Int::GCC::Edge::prev | ( | void | ) | const [inline] |
| Edge * Gecode::Int::GCC::Edge::vnext | ( | void | ) | const [inline] |
| Edge * Gecode::Int::GCC::Edge::vprev | ( | void | ) | const [inline] |
| VarNode * Gecode::Int::GCC::Edge::getVar | ( | void | ) | [inline] |
return the pointer to the variable node x of this edge
Definition at line 1172 of file graphsup.icc.
| ValNode * Gecode::Int::GCC::Edge::getVal | ( | void | ) | [inline] |
| VVGNode * Gecode::Int::GCC::Edge::getMate | ( | bool | t | ) | [inline] |
| void Gecode::Int::GCC::Edge::use | ( | void | ) | [inline] |
| void Gecode::Int::GCC::Edge::free | ( | void | ) | [inline] |
Mark the edge as unused.
the failure is here, capacity is not increased for value nodes
Definition at line 1097 of file graphsup.icc.
| void Gecode::Int::GCC::Edge::reset | ( | void | ) | [inline] |
Reset the edge ( free the edge, and unmatch the edge including its end-nodes.
Definition at line 1108 of file graphsup.icc.
| void Gecode::Int::GCC::Edge::match | ( | void | ) | [inline] |
| void Gecode::Int::GCC::Edge::unmatch | ( | void | ) | [inline] |
| void Gecode::Int::GCC::Edge::unmatch | ( | bool | t | ) | [inline] |
| void Gecode::Int::GCC::Edge::unlink | ( | void | ) | [inline] |
| void Gecode::Int::GCC::Edge::del_edge | ( | void | ) | [inline] |
| void Gecode::Int::GCC::Edge::insert_edge | ( | void | ) | [inline] |
| Edge ** Gecode::Int::GCC::Edge::next_ref | ( | void | ) | [inline] |
| Edge ** Gecode::Int::GCC::Edge::prev_ref | ( | void | ) | [inline] |
return the reference to the previous edge incident on x
Definition at line 1153 of file graphsup.icc.
| Edge ** Gecode::Int::GCC::Edge::vnext_ref | ( | void | ) | [inline] |
| Edge ** Gecode::Int::GCC::Edge::vprev_ref | ( | void | ) | [inline] |
return the reference to the previous edge incident on v
Definition at line 1163 of file graphsup.icc.
The documentation for this class was generated from the following file:
- gecode/int/gcc/graphsup.icc (Revision: 6323)