Graph6
(Mathematica Import/Export Format) Graph6 graph data format. Used for storing undirected graphs. ASCII format. Stores connectivity information for multiple undirected graphs. Suitable for small graphs or large ...
Sparse6
(Mathematica Import/Export Format) sparse6 graph data format. Used for storing undirected graphs. ASCII format. Stores connectivity information for multiple undirected graphs. Suitable for large sparse graphs, ...
MapThread[f, {{a_1, a_2, ...}, {b_1, b_2, ...}, ...}] gives {f[a_1, b_1, ...], f[a_2, b_2, ...], ...}. MapThread[f, {expr_1, expr_2, ...}, n] applies f to the parts of the ...
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 ...
When searching for a real simple root of a real valued function, it is possible to take advantage of the special geometry of the problem, where the function crosses the axis ...
LayeredGraphPlot[{v i 1 -> v j 1, v i 2 -> v j 2, ...}] generates a layered plot of the graph in which vertex v_ik is connected to vertex v_jk.LayeredGraphPlot[{{v i 1 -> v j ...
All the functions FindMinimum, FindMaximum, and FindRoot take variable specifications of the same form. The function FindFit uses the same form for its parameter ...
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}, ...
IncidenceMatrix[g] returns the (0, 1)-matrix of graph g, which has a row for each vertex and a column for each edge and (v, e) = 1 if and only if vertex v is incident upon ...
Explicit
(Numerical Differential Equation Analysis Package Symbol) Explicit is a setting for the option RungeKuttaMethod specifying the type of Runge\[Dash]Kutta method to be generated.