sets the id of the node in the graph be sure that the graph keeps consistent after changing the id

* sets the initial estimate from an array of double. * Implement setMinimalEstimateDataImpl() * @return true on success */

* sets the initial estimate from an array of double * @return true on success */

* Sets the timestamp from seconds and microseconds * @param secs: seconds * @param usecs: microseconds */

sets the node to the origin (used in the multilevel stuff)

Clears the result set and adjusts the search radius. */

* Returns the number of words in the vocabulary * @return number of words */

size is constant

Returns number of points in dataset */

* Inverts the diagonal blocks of A * @returns false if not defined. */

return the underlying solver used to solve the linear system

* sort the blocks in each column */

swap (note: linear complexity in N, constant for given instantiation)

return the diameter of the trust region

* Computes the inde memory usage * Returns: memory used by the index */

return the lambda set by the user, if < 0 the SparseOptimizer will compute the initial lambda

* Checks if the direct index is being used * @return true iff using direct index */

Returns the length of each point in the dataset */

verbose information during optimization

returns the vertex number <i>id</i> appropriately casted

returns the pointer to the ith vertex connected to the hyper-edge. */