SpringEmbedding[g] beautifies the embedding of graph g by modeling the embedding as a system of springs. SpringEmbedding[g, step, increment] can be used to refine the ...
ToAdjacencyMatrix[g] constructs an adjacency matrix representation for graph g. ToAdjacencyMatrix[g, EdgeWeight] returns edge weights as entries of the adjacency matrix with ...
ToOrderedPairs[g] constructs a list of ordered pairs representing the edges of the graph g.
VertexColoring[g] uses Brelaz's heuristic to find a good, but not necessarily minimal, vertex coloring of graph g.
VertexCover[g] returns a vertex cover of the graph g.
New functions SymmetricPolynomial and SymmetricReduction have been added to the built-in Mathematica kernel.
Convergents and QuadraticIrrationalQ have been added to the built-in Mathematica kernel.
ConvexHullMedian[{{x_1, y_1}, ..., {x_n, y_n}}] estimates the median to be the mean of the bivariate data points lying on the innermost layer of the convex layers of the data.
DelaunayTriangulation[{{x_1, y_1}, {x_2, y_2}, ...}] yields the planar Delaunay triangulation of the points {{x_1, y_1}, ...}.
Hull
(Computational Geometry Package Symbol) Hull is an option to DelaunayTriangulation that specifies whether the convex hull hull is to be returned in addition to the vertex adjacency list val describing the ...