Dijkstra[g, v] gives a shortest-path spanning tree and associated distances from vertex v of graph g. The shortest-path spanning tree is given by a list in which element i is ...

GeneralizedPetersenGraph[n, k] returns the generalized Petersen graph, for integers n > 1 and k > 0, which is the graph with vertices {u_1, u_2, ..., u_n} and {v_1, v_2, ..., ...

GridGraph[n, m] constructs an n*m grid graph, the product of paths on n and m vertices. GridGraph[p, q, r] constructs a p*q*r grid graph, the product of GridGraph[p, q] and a ...

NecklacePolynomial[n, c, Cyclic] returns a polynomial in the colors in c whose coefficients represent numbers of ways of coloring an n-bead necklace with colors chosen from ...

RandomGraph[n, p] constructs a random labeled graph on n vertices with an edge probability of p.

ShortestPathSpanningTree[g, v] constructs a shortest-path spanning tree rooted at v, so that a shortest path in graph g from v to any other vertex is a path in the tree.

ToUnorderedPairs[g] constructs a list of unordered pairs representing the edges of graph g. Each edge, directed or undirected, results in a pair in which the smaller vertex ...

The symbolic functions in Calculus`FourierTransform` have been added to the built-in Mathematica kernel. The numerical functionality in Calculus`FourierTransform` is now ...

ListPointPlot3D has been added to the built-in Mathematica kernel. ListSurfacePlot3D has been added to the built-in Mathematica kernel. BarChart3D has been added to the ...

ContourPlot in the built-in Mathematica kernel now accepts equations.