LinearProgramming[c, m, b] finds a vector x that minimizes the quantity c.x subject to the constraints m.x >= b and x >= 0. LinearProgramming[c, m, {{b_1, s_1}, {b_2, s_2}, ...
ClosenessCentrality[g] finds the closeness centrality.
MaximalBipartiteMatching[g] gives the maximal matching of the bipartite graph g.
MaximalIndependentVertexSet[g] gives a maximal independent vertex set of an undirected graph g.MaximalIndependentVertexSet[g, w] gives a maximal independent vertex set of g ...
Differences[list] gives the successive differences of elements in list. Differences[list, n] gives the n\[Null]^th differences of list. Differences[list, {n_1, n_2, ...}] ...
ContourPlot[f, {x, x_min, x_max}, {y, y_min, y_max}] generates a contour plot of f as a function of x and y. ContourPlot[f == g, {x, x_min, x_max}, {y, y_min, y_max}] plots ...
DiscreteWaveletPacketTransform[data] gives the discrete wavelet packet transform (DWPT) of an array of data.DiscreteWaveletPacketTransform[data, wave] gives the discrete ...
Groups admit many different representations. In particular, all finite groups can be represented as permutation groups, that is, they are always isomorphic to a subgroup of ...
CUDAFunctionLoad[src, fun, argtypes, blockdim] loads CUDAFunction from scr and makes fun available in Mathematica.CUDAFunctionLoad[{srcfile}, fun, argtypes, blockdim] loads ...
This example displays a dialog for finding prime numbers and alerting the user when any entered expression evaluates to a prime number. The modal version also shows how ...