\brief Initialize the algorithm and perform Dijkstra. This function initializes the algorithm and performs a full Dijkstra search from the given sour

Compute 2*exp(-1j*pi*(u+1)/(2N)), but not exactly the same. The actual return is 2*cos(pi*(u+1)/(2N)), 2*sin(pi*(u+1)/(2N))

* @brief Get the model index of any instance. * @param id instance index * @return model index */

@brief construct array of rectangles

\brief Find an initial matching in a greedy way. This function finds an initial matching in a greedy way.

Function: hash_value

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

Conversion between XY and index

Initialize the solver

\brief Executes the algorithm with arc number limit. Executes the algorithm with arc number limit. This method runs the Bellman-Ford algorithm from

@brief load from json file

Is the constraint lower bounded?

\brief An upper bound on the arc IDs. Returns an upper bound on the arc IDs.

\brief An upper bound on the blue IDs. Returns an upper bound on the blue IDs.

\brief An upper bound on the edge IDs. Returns an upper bound on the edge IDs.

\brief An upper bound on the node IDs. Returns an upper bound on the node IDs.

\brief An upper bound on the red IDs. Returns an upper bound on the red IDs.

Rearrange the items of the heap and make the first box non-empty