HamiltonianQ[g] yields True if there exists a Hamiltonian cycle in graph g, or in other words, if there exists a cycle that visits each vertex exactly once.
Mathematica includes many controls and structures related to controls as part of its core language. These control objects are supported in a completely seamless way ...
FindHamiltonianCycle[g] finds a Hamiltonian cycle in the graph g if one exists.
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[{..., ...
.NET/Link provides Mathematica users with the ability to interact with arbitrary .NET types directly from Mathematica. You can create objects and call methods and properties ...
Numerical algorithms for constrained nonlinear optimization can be broadly categorized into gradient-based methods and direct search methods. Gradient search methods use ...
Scan
(Built-in Mathematica Symbol) 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.