FindShortestPath[g, s, t] finds the shortest path from source vertex s to target vertex t in the graph g.FindShortestPath[g, s, All] generates a ShortestPathFunction[...] ...

NMaximize[f, x] maximizes f numerically with respect to x.NMaximize[f, {x, y, ...}] maximizes f numerically with respect to x, y, .... NMaximize[{f, cons}, {x, y, ...}] ...

NMinimize[f, x] minimizes f numerically with respect to x.NMinimize[f, {x, y, ...}] minimizes f numerically with respect to x, y, .... NMinimize[{f, cons}, {x, y, ...}] ...

BubbleChart3D[{{x_1, y_1, z_1, u_1}, {x_2, y_2, z_2, u_2}, ...}] makes a 3D bubble chart with bubbles at positions {x_i, y_i, z_i} with sizes u_i.BubbleChart3D[{..., ...

Numerical algorithms for constrained nonlinear optimization can be broadly categorized into gradient-based methods and direct search methods. Gradient search methods use ...

Scan[f, expr] evaluates f applied to each element of expr in turn. Scan[f, expr, levelspec] applies f to parts of expr specified by levelspec.

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 ...

LinkRankMatrix[g] returns the link rank of the graph g, in the form of a sparse matrix. The link rank of an edge u -> v is defined as the PageRanks of u, divided by the ...

LinkRanks[g] gives the link ranks of the directed graph g as a rule list.

Cases[{e_1, e_2, ...}, pattern] gives a list of the e_i that match the pattern. Cases[{e_1, ...}, pattern -> rhs] gives a list of the values of rhs corresponding to the e_i ...