Return a highest level active item or INVALID if there is no active item.

Finalize the initialization process.

Start the initialization process.

child indices of a heap

@brief load from json file

@brief Load placement data

Set the sense to maximization

\brief Gives back a negative cycle. This function gives back a directed cycle with negative total length if the algorithm has already found one. Othe

Next arc to be processed. \return The next arc to be processed or \c INVALID if the stack is empty.

notify wakes one or all waiting threads. Must be called after changing the associated wait predicate.

@brief number of BLEs in a half CLB

@brief get signal type of one pin

Processes the next arc. \return The processed arc. \pre The stack must not be empty.

@brief append at the last row

@brief set the index of the start of the ith row Be aware that there is always a 0 at the first entry

-<a href="qh-poly_r.htm#TOC" >-------------------------------</a><a name="checklists">-</a> qh_checklists(qh, facetli

-<a href="qh-poly_r.htm#TOC" >-------------------------------</a><a name="clearcenters">-</a> qh_clearcenters(qh, typ

-<a href="qh-merge_r.htm#TOC" >-------------------------------</a><a name="findbestneighbor">-</a> qh_findbestneighbo

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

-<a href="qh-geom_r.htm#TOC" >-------------------------------</a><a name="maxsimplex">-</a> qh_maxsimplex(qh, dim, ma

-<a href="qh-merge_r.htm#TOC" >-------------------------------</a><a name="newvertices">-</a> qh_newvertices(qh, vert

-<a href="qh-io_r.htm#TOC" >-------------------------------</a><a name="printcenter">-</a> qh_printcenter(qh, fp, str

------------------------------------------------ outxxx - output functions for qh_rboxpoints */

-<a href="qh-set_r.htm#TOC" >-------------------------------<a name="setcompact">-</a> qh_setcompact(qh, set ) re

-<a href="qh-set_r.htm#TOC" >-------------------------------<a name="setindex">-</a> qh_setindex(set, atelem ) re

-<a href="qh-set_r.htm#TOC" >-------------------------------<a name="setnew_delnthsorted">-</a> qh_setnew_delnthsorte

\brief Make a snapshot. This function makes a snapshot of the given graph. It can be called more than once. In case of a repeated call, the previous

@brief setter for instance index

@brief number of all elements

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

\brief Called when the source node is leaved. This function is called when the source node is leaved.

@brief getter for top module index

@brief default constructor

--------------------------------------------------------------- @brief returns true if all children is blocking */

\brief Number of arcs.

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

\brief The cardinality of a node. Returns the cardinality of a node. \pre \ref run() must be called before using this function. \warning If node \c v

\brief Clears the union-find data structure Erase each item from the data structure.

Procedure: clear

\param c is the column to be modified \param e is a dual linear expression (see \ref DualExpr) a better one.

The upper bound of a variable (column) has to be given by an extended number of type Value, i.e. a finite number of type Value or \ref INF.

@brief speculate the design name for dumping out intermediate solutions