Edges in view-value graph.
More...
#include <view-val-graph.hh>
template<class View>
class Gecode::Int::ViewValGraph::Edge< View >
Edges in view-value graph.
Definition at line 208 of file view-val-graph.hh.
◆ Edge() [1/2]
Construct new edge between x and v.
Definition at line 38 of file edge.hpp.
◆ Edge() [2/2]
Construct new edge between x and v with next edge n.
Definition at line 44 of file edge.hpp.
◆ dst()
Return destination of edge when source s is given.
Definition at line 51 of file edge.hpp.
◆ view()
Return view node when value node v is given.
Definition at line 64 of file edge.hpp.
◆ val()
Return value node when view node x is given.
Definition at line 69 of file edge.hpp.
◆ used()
Whether edge is used (marked or between nodes from the same scc)
Definition at line 75 of file edge.hpp.
◆ use()
Mark node as used.
Definition at line 80 of file edge.hpp.
◆ free()
Unmark node as used.
Definition at line 85 of file edge.hpp.
◆ revert()
Revert edge to node d for matching.
Definition at line 57 of file edge.hpp.
◆ next_edge()
Return next edge in list of value edges.
Definition at line 91 of file edge.hpp.
◆ next_edge_ref()
Return reference to next edge in list of value edges.
Definition at line 96 of file edge.hpp.
◆ next()
Return next edge in list of edges per node.
Definition at line 101 of file edge.hpp.
◆ operator new()
Allocate memory from space.
Definition at line 113 of file edge.hpp.
◆ operator delete() [1/2]
Needed for exceptions.
Definition at line 107 of file edge.hpp.
◆ operator delete() [2/2]
Needed for exceptions.
Definition at line 110 of file edge.hpp.
◆ _next_edge
◆ sd
The documentation for this class was generated from the following files: