WidgetFill[] is a widget layout placeholder used when adjacent widgets should not dominate the layout space.

AnimateGraph[g, l] displays graph g with each element in the list l successively highlighted. Here l is a list containing vertices and edges of g. An optional flag, which ...

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

ListNecklaces[n, c, Cyclic] returns all distinct necklaces whose beads are colored by colors from c. Here c is a list of n, not necessarily distinct colors, and two colored ...

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.

VertexColoring[g] uses Brelaz's heuristic to find a good, but not necessarily minimal, vertex coloring of graph g.

Distributions defined in this package have been added to the built-in Mathematica kernel. The input syntax for DiscreteUniformDistribution has changed. Random and RandomArray ...

ValueFunction[symb] represents a function to be applied whenever the symbol symb gets a new value.

WishartDistribution[\[CapitalSigma], m] represents a Wishart distribution with scale matrix \[CapitalSigma] and degrees of freedom parameter m.

ButcherTreeSimplify[p, \[Eta], \[Xi]] gives the set of trees through order p that are not reduced by Butcher's quadrature conditions through order p, row-simplifying ...