--------------------------------------------------------------- @brief returns either longest matching prefix of 'arg' in any * of the fl

\brief Returns \c true when the node is on the source side of the minimum cut. Returns true when the node is on the source side of the found minimum

@brief getter for model type

Returns \c true if \c a is \e surely negative

@brief get signal direction of one pin

Returns \c true if \c v is processed, i.e. the shortest path to \c v has already found. \pre Either \ref run(Node) "run()" or \ref init() must be cal

-<a href="qh-merge_r.htm#TOC" >-------------------------------</a><a name="degen_redundant_facet">-</a> qh_degen_redu

-<a href="qh-mem_r.htm#TOC" >-------------------------------</a><a name="memsize">-</a> qh_memsize(qh, size ) def

-<a href="qh-merge_r.htm#TOC" >-------------------------------</a><a name="mergefacet">-</a> qh_mergefacet(qh, facet1

-<a href="qh-geom_r.htm#TOC" >-------------------------------</a><a name="outerinner">-</a> qh_outerinner(qh, facet,

-<a href="qh-geom_r.htm#TOC" >-------------------------------</a><a name="pointdist">-</a> qh_pointdist( point1, poin

-<a href="qh-io_r.htm#TOC" >-------------------------------</a><a name="projectdim3">-</a> qh_projectdim3(qh, source,

-<a href="qh-set_r.htm#TOC" >-------------------------------<a name="setcheck">-</a> qh_setcheck(qh, set, typename, i

-<a href="qh-set_r.htm#TOC" >-------------------------------<a name="setdelsorted">-</a> qh_setdelsorted( set, oldele

-<a href="qh-set_r.htm#TOC" >-------------------------------<a name="setlast">-</a> qh_setlast( set ) return last

-<a href="qh-set_r.htm#TOC" >-------------------------------<a name="settemppush">-</a> qh_settemppush(qh, set )

-<a href="qh-set_r.htm#TOC" >-------------------------------<a name="setzero">-</a> qh_setzero(qh, set, index, size )

-<a href="qh-geom_r.htm#TOC" >-------------------------------</a><a name="vertex_bestdist">-</a> qh_vertex_bestdist(q

-<a href="qh-merge_r.htm#TOC" >-------------------------------</a><a name="willdelete">-</a> qh_willdelete(qh, facet,

Returns the number of the nodes to be processed in the queue (stack).

@brief set the site dimension. The size of each site is explictly given.

\brief Removes the coefficients which's absolute value does not exceed \c epsilon. It also sets to zero the constant component, if it does not exceed

\brief The number of items stored in the heap. This function returns the number of items stored in the heap.

Function: size query the size

\brief The total cost of the found tour. This function returns the total cost of the found tour. \pre run() must be called before using this functio

The type of the MIP problem

@brief write to file

\brief The arc with the given ID. Returns the arc with the given ID. \pre The argument should be a valid arc ID in the graph.

\brief Return the number of the blossoms in the basis. This function returns the number of the blossoms in the basis. \pre Either run() or start() m

\brief Return the number of the nodes in the given blossom. This function returns the number of the nodes in the given blossom. \pre Either run() or

This function erases all nodes and arcs from the graph.

@brief getter for clock region id

Compute triangle and exact density maps for 1 area type

\brief Return the total cost of the found cycle. This function returns the total cost of the found cycle. \pre \ref run() or \ref findCycleMean() mu

Function: empty

@brief API @param pos cell centers. The array consists of (x, y) locations of all cells

* @brief getter for the geometry bounding box */