|
| | 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.
|
| |
| BiLink * | next (void) const |
| | Return next 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.
|
| |
template<class View>
class Gecode::Int::ViewValGraph::Edge< View >
Edges in view-value graph.
Definition at line 208 of file view-val-graph.hh.