@brief check whether an instance is a LUT

\brief Initialize arc iterator to point to the n-th arc \pre \c n is in the <tt>[0..length() - 1]</tt> range.

-<a href="qh-user_r.htm#TOC" >-------------------------------</a><a name="qh_malloc">-</a> qh_malloc( mem )

-<a href="qh-poly_r.htm#TOC" >-------------------------------</a><a name="removefacet">-</a> qh_removefacet(qh, facet

@brief setter for signal direction

@brief size of the second dimension

@brief getter the range of data at the first dimension

\brief Gives back %true for blue nodes. Gives back %true for blue nodes.

\brief The direction of the arc. Returns \c true if the direction of the given arc is the same as the inherent orientation of the represented edge.

\brief Returns the value of the maximum flow. Returns the value of the maximum flow by returning the excess of the target node. This value equals to

\brief Increase the priority of an item to the given value. This function increases the priority of an item to the given value. \param i The item. \p

@brief getter for net

Function: num_workers

This function returns the 'previous node' of the %DFS tree for the node \c v, i.e. it returns the last but one node of a %DFS path from a root to \c v

Push new gap, move s count bytes further (skipping the gap). Collapse previous gap.

This method runs the %DFS algorithm from node \c s in order to compute the DFS path to each node. The algorithm computes - the %DFS tree, - the dista

\brief Sets the container. Sets the container.

\brief Splice a path into the current path. It splices the \c tpath into the current path before the position of \c it iterator and \c tpath becomes

\brief Returns the blue node with the given index. Returns the blue node with the given index. Since this structure is completely static, the blue no

This function erases all nodes and arcs from the graph. \note All iterators of the graph are invalidated, of course.

Function: end

\brief Erase a node from the graph. This function erases the given node along with its incident arcs from the graph. \note All iterators referencing

-<a href="qh-poly_r.htm#TOC" >-------------------------------</a><a name="appendfacet">-</a> qh_appendfacet(qh, facet

-<a href="qh-geom_r.htm#TOC" >-------------------------------</a><a name="getcentrum">-</a> qh_getcentrum(qh, facet )

-<a href="qh-poly_r.htm#TOC" >-------------------------------</a><a name="printlists">-</a> qh_printlists(qh) pri

-<a href="qh-set_r.htm#TOC" >-------------------------------<a name="setreplace">-</a> qh_setreplace(qh, set, oldelem

-<a href="qh-poly_r.htm#TOC" >-------------------------------</a><a name="vertexneighbors">-</a> qh_vertexneighbors(q

\brief Returns the red node with the given index. Returns the red node with the given index. Since this structure is completely static, the red nodes

This function is a shorthand for a reset() and a start() calls.

parsing scl file */

Query whether item \c i is active

\brief Add a new arc before the current path

Function: begin

find the transposed fill

Add an item to the current level.

@brief get the resource category of an instance

@brief check whether an instance is FF

Give back the left side of the box. If the box is empty, then the return value is not defined.

@brief number of nets