Edges in view-value graph.
More...
#include <view-val-graph.hh>
List of all members.
Public Member Functions |
| Edge (ValNode< View > *v, ViewNode< View > *x) |
| Construct new edge between x and v.
|
| Edge (ValNode< View > *v, ViewNode< View > *x, Edge< View > *n) |
| Construct new edge between x and v with next edge n.
|
Node< View > * | dst (Node< View > *s) const |
| Return destination of edge when source s is given.
|
ViewNode< View > * | view (ValNode< View > *v) const |
| Return view node when value node v is given.
|
ValNode< View > * | val (ViewNode< View > *x) const |
| Return value node when view node x is given.
|
bool | used (Node< View > *v) const |
| Whether edge is used (marked or between nodes from the same scc)
|
void | use (void) |
| Mark node as used.
|
void | free (void) |
| Unmark node as used.
|
void | revert (Node< View > *d) |
| Revert edge to node d for matching.
|
Edge< View > * | next_edge (void) const |
| Return next edge in list of value edges.
|
Edge< View > ** | next_edge_ref (void) |
| Return reference to next edge in list of value edges.
|
Edge< View > * | next (void) const |
| Return next edge in list of edges per node.
|
| BiLink (void) |
| Initialize as empty (self referenced)
|
BiLink * | prev (void) const |
| Return previous element.
|
void | prev (BiLink *l) |
| Set previous element to l.
|
void | next (BiLink *l) |
| Set next element to l.
|
void | add (BiLink *l) |
| Add l after this element.
|
void | unlink (void) |
| Unlink this element.
|
void | mark (void) |
| Mark element (invalidates next element pointer)
|
bool | marked (void) const |
| Whether element is marked.
|
bool | empty (void) const |
| Whether element has no previous and next element.
|
Protected Attributes |
Edge< View > * | _next_edge |
| Next edge in chain of value edges.
|
CombPtrFlag< Node< View > > | sd |
| Combine source and destination node and flag.
|
Detailed Description
template<class View>
class Gecode::Int::ViewValGraph::Edge< View >
Edges in view-value graph.
Definition at line 212 of file view-val-graph.hh.
Constructor & Destructor Documentation
Construct new edge between x and v.
Definition at line 42 of file edge.hpp.
Construct new edge between x and v with next edge n.
Definition at line 48 of file edge.hpp.
Member Function Documentation
Return destination of edge when source s is given.
Definition at line 55 of file edge.hpp.
Return view node when value node v is given.
Definition at line 68 of file edge.hpp.
Return value node when view node x is given.
Definition at line 73 of file edge.hpp.
Whether edge is used (marked or between nodes from the same scc)
Definition at line 79 of file edge.hpp.
Mark node as used.
Definition at line 84 of file edge.hpp.
Unmark node as used.
Definition at line 89 of file edge.hpp.
Revert edge to node d for matching.
Definition at line 61 of file edge.hpp.
Return next edge in list of value edges.
Definition at line 95 of file edge.hpp.
Return reference to next edge in list of value edges.
Definition at line 100 of file edge.hpp.
Allocate memory from space.
Definition at line 117 of file edge.hpp.
Needed for exceptions.
Definition at line 111 of file edge.hpp.
Needed for exceptions.
Definition at line 114 of file edge.hpp.
Member Data Documentation
The documentation for this class was generated from the following files: