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

Edges[g] gives the list of edges in g. Edges[g, All] gives the edges of g along with the graphics options associated with each edge. Edges[g, EdgeWeight] returns the list of ...

IsomorphicQ[g, h] yields True if graphs g and h are isomorphic.

Isomorphism[g, h] gives an isomorphism between graphs g and h if one exists. Isomorphism[g, h, All] gives all isomorphisms between graphs g and h. Isomorphism[g] gives the ...

MakeDirected[g] constructs a directed graph from a given undirected graph g by replacing each undirected edge in g by two directed edges pointing in opposite directions.

NumberOfNecklaces[n, nc, Cyclic] returns the number of distinct ways in which an n-bead necklace can be colored with nc colors, assuming that two colorings are equivalent if ...

OrbitInventory[ci, x, w] returns the value of the cycle index ci when each formal variable x[i] is replaced by w. OrbitInventory[ci, x, weights] returns the inventory of ...

ToCanonicalSetPartition[sp, set] reorders sp into a canonical order with respect to set. ToCanonicalSetPartition[sp] reorders sp into canonical order, assuming that ...

New functions SymmetricPolynomial and SymmetricReduction have been added to the built-in Mathematica kernel.

New functions Animate and ListAnimate have been added to the built-in Mathematica kernel. SpinShow is replaced by interactive rotation of three-dimensional graphics.