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

KSetPartitions[set, k] returns the list of set partitions of set with k blocks. KSetPartitions[n, k] returns the list of set partitions of {1, 2, ..., n} with k blocks. If ...

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.

ToUnorderedPairs[g] constructs a list of unordered pairs representing the edges of graph g. Each edge, directed or undirected, results in a pair in which the smaller vertex ...

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.

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.

EquationTrekkerState[{eqns, dvars, {t, t_min, t_max}}, params, treks, opts] is the data object returned by the function EquationTrekker, that contains the information needed ...