GraphDistanceMatrix[g] gives a matrix in which the (i, j)\[Null]^th entry is the length of a shortest path in g between vertices i and j.GraphDistanceMatrix[g, Parent] ...
Numerical algorithms for constrained nonlinear optimization can be broadly categorized into gradient-based methods and direct search methods. Gradient search methods use ...
MaxIterations is an option that specifies the maximum number of iterations that should be tried in various built-in functions and algorithms.
This package implements primality proving. If ProvablePrimeQ[n] returns True, then the number n can be mathematically proven to be prime. In addition, PrimeQCertificate[n] ...
GeneralMiniMaxApproximation[{f_x, f_y}, {t, {t_0, t_1}, m, n}, x] finds the rational polynomial function of x, with numerator order m and denominator order n, that gives a ...
GraphPath[g, start, end] finds a shortest path between vertices start and end in graph g.
DeleteSmallComponents[image] replaces small connected components in a binary image image with background pixels.DeleteSmallComponents[m] replaces positive integers in a label ...
EdgeDetect[image] finds edges in image and returns the result as a binary image.EdgeDetect[image, r] finds edges at the scale of the specified pixel range r.EdgeDetect[image, ...
FindThreshold[image] finds a global threshold value that partitions the intensity values in image into two intervals.
HessenbergDecomposition[m] gives the Hessenberg decomposition of a matrix m.