\brief Number of blue nodes.

\note On <tt>WIN32</tt> platform this value is not calculated.

\note On <tt>WIN32</tt> platform this value is not calculated.

@brief returns non-mutating iterator to position of first element */

\brief Change the first node of an edge. This function changes the first node of the given edge \c e to \c n. \note \c EdgeIt and \c ArcIt iterators

\brief Change the second node of an edge. This function changes the second node of the given edge \c e to \c n. \note \c EdgeIt iterators referencin

Check whether or not the last execution provides a barrier. \sa barrier() \sa barrierMap()

Checks tour validity

\brief Executes the algorithm and checks the negative cycles. Executes the algorithm and checks the negative cycles. This method runs the Bellman-Fo

\brief Make the heap empty. This functon makes the heap empty. It does not change the cross reference map. If you want to reuse a heap that is not su

\param r is the row of the element to be modified \param c is the column of the element to be modified \param val is the new value of the coefficient

Sets the type of the given column to the given type.

This function instantiates a \ref DistMap. \param g is the digraph, to which we would like to define the \ref DistMap.

This function instantiates a \ref ReachedMap. \param g is the digraph, to which we would like to define the \ref ReachedMap.

This function instantiates a \ref ReachedMap. \param g is the digraph, to which we would like to define the \ref ReachedMap.

@brief gets the memcpy node parameter of a memcpy task (untyped) */

@brief gets the memset node parameter of a memcpy task (untyped) */

Returns the current distance of the given node from the root(s). It may be decreased in the following processes. \pre Either \ref run(Node) "run()" o

Batch Discrete Cosine Transformation without normalization to coefficients. Compute y_u = \sum_i x_i cos(pi*(2i+1)*u/(2N)), Impelements the

Batch Discrete Cosine Transformation without normalization to coefficients. Compute y_u = \sum_i x_i cos(pi*(2i+1)*u/(2N)), Impelements the

Uniform distribution on the full unit circle.

\brief Called when an arc reaches a new node. This function is called when the DFS finds an arc whose target node is not reached yet.

Returns a \ref Color which is as different from the given parameter as it is possible.

Batch Discrete Sine Transformation without normalization to coefficients. Compute y_u = \sum_i x_i sin(pi*(2i+1)*(u+1)/(2N)), Impelements th

Procedure: dump

\brief Erase the last arc of the path

\brief Called when an arc is examined but its target node is already discovered. This function is called when an arc is examined but its target node

\brief Execute the algorithm to find an optimal flow. This function executes the successive shortest path algorithm to find a minimum cost flow, whic

:param inst_pos: center of instances, array of (x, y) pairs, shape of (#instance, ) :return: the well energy of instances

@brief API @param pos cell locations of (x, y) pairs.

:param inst_sizes: pair (width, height) of cell sizes, shape of (#instance, 2) :param inst_pos: center of instances, array of (x, y)

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

Forward function that calculates the routing congestion map :param pin_pos: tensor of pin position, length of 2 * #pins, in the form of xyxy

@brief Top API to solve placement

The second parameter is dummy.