AdjacencyGraph[amat] gives the graph with adjacency matrix amat.AdjacencyGraph[{v_1, v_2, ...}, amat] gives the graph with vertices v_i and adjacency matrix amat.

ListPlot[{y_1, y_2, ...}] plots points corresponding to a list of values, assumed to correspond to x coordinates 1, 2, .... ListPlot[{{x_1, y_1}, {x_2, y_2}, ...}] plots a ...

PathGraph[{v_1, v_2, ...}] yields a path with vertices v_i and edges between v_i and v i +\[ThinSpace]1 .PathGraph[{e_1, e_2, ...}] yields a path with edges ...

BarChart3D[{y_1, y_2, ...}] makes a 3D bar chart with bar lengths y_1, y_2, ....BarChart3D[{..., w_i[y_i, ...], ..., w_j[y_j, ...], ...}] makes a 3D bar chart with bar ...

DensityHistogram[{{x_1, y_1}, {x_2, y_2}, ...}] plots a density histogram of the values {x_i, y_i}.DensityHistogram[{{x_1, y_1}, {x_2, y_2}, ...}, bspec] plots a density ...

TreeGraph[{v_1, v_2, ...}, {u_1, u_2, ...}] yields a tree where u_i is the predecessor of v_i.TreeGraph[{e_1, e_2, ...}] yields a tree with edges e_j.TreeGraph[{v_1, v_2, ...

Linear programming problems are optimization problems where the objective function and constraints are all linear. Mathematica has a collection of algorithms for solving ...

Combining a new level of programmatic support for symbolic color with carefully chosen aesthetic color parametrizations, Mathematica allows a uniquely flexible and compelling ...

Mathematica 's unified symbolic graphics architecture makes it possible to mix programmatic graphics generation with interactive editing and control. The Mathematica Drawing ...

PlotRangeClipping is an option for graphics functions that specifies whether graphics objects should be clipped at the edge of the region defined by PlotRange, or should be ...