ShortestPath[g, start, end] finds a shortest path between vertices start and end in graph g.

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.

StationaryWaveletPacketTransform[data] gives the stationary wavelet packet transform (SWPT) of an array of data.StationaryWaveletPacketTransform[data, wave] gives the ...

VertexCover[g] returns a vertex cover of the graph g.

Mathematica has the most extensive collection of mathematical functions ever assembled. Often relying on original results and algorithms developed at Wolfram Research over ...

Approximate is a value that the option Algorithm can take in calls to functions such as VertexCover, telling it to use an approximation algorithm.

Greedy is a value that the option Algorithm can take in calls to functions such as VertexCover, telling the function to use a greedy algorithm.

Introduction Linear Optimization Numerical Nonlinear Local Optimization

A core activity in exploratory experimental mathematics is recognition of numbers: going backward from a number to find out how it can be generated. Mathematica provides ...

For many kinds of practical calculations, the only operations you will need to perform on polynomials are essentially structural ones. If you do more advanced algebra with ...