Brelaz
(Combinatorica Package Symbol) Brelaz is a value that the option Algorithm can take when used in the function VertexColoring.
Optimum
(Combinatorica Package Symbol) Optimum is a value that the option Algorithm can take on when used in functions VertexColoring and VertexCover.
Introduction General Graph Drawing Hierarchical Drawing of Directed Graphs
MaximumSpanningTree[g] uses Kruskal's algorithm to find a maximum spanning tree of graph g.
Animate
(Built-in Mathematica Symbol) Animate[expr, {u, u_min, u_max}] generates an animation of expr in which u varies continuously from u_min to u_max. Animate[expr, {u, u_min, u_max, du}] takes u to vary in ...
Mathematica's extensive base of state-of-the-art algorithms, efficient handling of very long integers, and powerful built-in language make it uniquely suited to both research ...
The control mechanisms set up for NDSolve enable you to define your own numerical integration algorithms and use them as specifications for the Method option of NDSolve. ...
MinimumSpanningTree[g] uses Kruskal's algorithm to find a minimum spanning tree of graph g.
A real polynomial system is an expression constructed with polynomial equations and inequalities combined using logical connectives and quantifiers and
Mathematica provides functions for the aesthetic drawing of graphs. Algorithms implemented include spring embedding, spring-electrical embedding, high-dimensional embedding, ...