One of the key problems in graphs is navigation. In particular, the problem is finding the shortest path between two vertices, whether that is finding the way out of a maze ...

Built into Mathematica is a uniquely flexible and concise language for creating 1D and 2D layouts—from simple tables to the most elaborate information displays and user ...

Mathematica 8 introduces a coherent collection of algorithms and data structures for working with permutation groups. Building upon Mathematica's proven symbolic ...

The single function Manipulate gives immediate access to a huge range of powerful interactive capabilities. For any expression with symbolic parameters, Manipulate ...

Because of its unified symbolic architecture, Mathematica provides powerful capabilities for creating layouts, both interactively and programmatically, and containing ...

The flexibility of Mathematica's symbolic architecture is reflected in its rich collection of carefully defined constructs for localization and modularization. The use of ...

Mathematica incorporates the latest highly efficient algorithms to allow operations on strings with millions of elements, all making use of Mathematica's unique symbolic ...

Mathematica's symbolic string patterns provide a compact yet readable basis for sophisticated string operations. Included directly in programs, or symbolically generated on ...

EdgeDelete[g, e] makes a graph by deleting the edge e from the graph g.EdgeDelete[g, {e_1, e_2, ...}] deletes a collection of edges from g.EdgeDelete[g, patt] deletes all ...

TransformationFunctions is an option for Simplify and FullSimplify which gives the list of functions to apply to try to transform parts of an expression.