BetweennessCentrality[g] gives a list of betweenness centralities for the vertices in the graph g.
MinDetect[image] gives a binary image in which white pixels correspond to constant extended minima in image.MinDetect[image, h] finds extended minima where the range of ...
ScrollingOptions -> {opt_1 -> val_1, opt_2 -> val_2, ...} is an option for notebooks that specifies settings for scrolling.
FindHamiltonianCycle[g] finds a Hamiltonian cycle in the graph g if one exists.
The library now fully supports the Unicode character encoding forms UTF-8, UTF-16, and UTF-32. Use the following new API functions to put or get Unicode characters to or from ...
StringToStream["string"] opens an input stream for reading from a string.
Searching for local minima and maxima. This finds the value of x which minimizes Γ(x), starting at x2. The last element of the list gives the value at which the minimum is ...
One of the key problems in graphs is navigation. In particular, the problem is finding the shortest path between two vertices, whether that is finding the way out of a maze ...
SatisfiabilityInstances[bf] attempts to find a choice of variables that makes the Boolean function bf yield True.SatisfiabilityInstances[expr, {a_1, a_2, ...}] attempts to ...
Mathematica contains the world's largest collection of number theoretic functions, many based on specially developed algorithms.