Gecode::Int::GCC::Edge Class Reference
List of all members.Detailed Description
Class for edges
Definition at line 312 of file graphsup.icc.
Constructors | |
Edge (VarNode *x, ValNode *v) | |
Construct edge ![]() | |
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) |
Mark the edge as used. | |
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
|
Construct edge
Definition at line 1030 of file graphsup.icc. |
Member Function Documentation
|
Create a new edge in memory.
Definition at line 1038 of file graphsup.icc. |
|
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 1072 of file graphsup.icc. |
|
return whether the edge is matched
Definition at line 1192 of file graphsup.icc. |
|
return whether the edge has been deleted from the graph
Definition at line 1212 of file graphsup.icc. |
|
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 1086 of file graphsup.icc. |
|
return the pointer to the next edge incident on x
Definition at line 1081 of file graphsup.icc. |
|
return the pointer to the previous edge incident on x
Definition at line 1105 of file graphsup.icc. |
|
return the pointer to the next edge incident on v
Definition at line 1095 of file graphsup.icc. |
|
return the pointer to the previous edge incident on v
Definition at line 1115 of file graphsup.icc. |
|
return the pointer to the variable node x of this edge
Definition at line 1129 of file graphsup.icc. |
|
return the pointer to the value node v of this edge
Definition at line 1134 of file graphsup.icc. |
|
return pointer to x if t = true otherwise return v
Definition at line 1139 of file graphsup.icc. |
|
Mark the edge as used.
Definition at line 1044 of file graphsup.icc. |
|
Mark the edge as unused. the failure is here, capacity is not increased for value nodes Definition at line 1054 of file graphsup.icc. |
|
Reset the edge ( free the edge, and unmatch the edge including its end-nodes.
Definition at line 1065 of file graphsup.icc. |
|
Match the edge.
Definition at line 1176 of file graphsup.icc. |
|
Unmatch the edge and the incident nodes.
Definition at line 1149 of file graphsup.icc. |
|
Unmatch the edge and ( x if t=false, v otherwise ).
Definition at line 1161 of file graphsup.icc. |
|
Unlink the edge from the linked list of edges.
Definition at line 979 of file graphsup.icc. |
|
Mark the edge as deleted during synchronization.
Definition at line 1201 of file graphsup.icc. |
|
Insert the edge again.
Definition at line 1206 of file graphsup.icc. |
|
return the reference to the next edge incident on x
Definition at line 1125 of file graphsup.icc. |
|
return the reference to the previous edge incident on x
Definition at line 1110 of file graphsup.icc. |
|
return the reference to the next edge incident on v
Definition at line 1100 of file graphsup.icc. |
|
return the reference to the previous edge incident on v
Definition at line 1120 of file graphsup.icc. |
The documentation for this class was generated from the following file:
- int/gcc/graphsup.icc (Revision: 2696)