graph.hpp
Go to the documentation of this file.
ValNode< View > * val(ViewNode< View > *x) const
Return value node when view node x is given.
Definition edge.hpp:69
Edge< View > ** next_edge_ref(void)
Return reference to next edge in list of value edges.
Definition edge.hpp:96
Node< View > * dst(Node< View > *s) const
Return destination of edge when source s is given.
Definition edge.hpp:51
Support::StaticStack< ViewNode< View > *, Region > ViewNodeStack
Stack used during matching.
Definition view-val-graph.hh:307
void purge(void)
Purge graph if necessary (reset information to avoid overflow).
Definition graph.hpp:130
void init(Space &home, ViewNode< View > *x)
Initialize the edges for the view node x.
Definition graph.hpp:51
Base-class for nodes (both view and value nodes).
Definition view-val-graph.hh:116
Edge< View > * iter
Next edge for computing strongly connected components.
Definition view-val-graph.hh:119
ValNode< View > ** next_val_ref(void)
Return pointer to next value node fields.
Definition node.hpp:99
Edge< View > ** val_edges_ref(void)
Return pointer to first edge fields of all value edges.
Definition node.hpp:135
Support classes for propagators using a view-value graph.
Gecode toplevel namespace
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition arithmetic.cpp:67
