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.
ShuffleExchangeGraph[n] returns the n-dimensional shuffle-exchange graph whose vertices are length n binary strings with an edge from w to Derivative[1][w] if (i) ...
ToAdjacencyLists[g] constructs an adjacency list representation for graph g. ToAdjacencyLists[g, EdgeWeight] returns an adjacency list representation along with edge weights.
ConvexHull
(Computational Geometry Package Symbol) ConvexHull[{{x_1, y_1}, {x_2, y_2}, ...}] yields the planar convex hull of the points {{x_1, y_1}, ...}, represented as a list of point indices arranged in counterclockwise ...
DelaunayTriangulationQ[{{x_1, y_1}, {x_2, y_2}, ...}, val] gives True if the triangulation of the points {{x_1, y_1}, ...} represented by the vertex adjacency list val is a ...
ComputerNumber[x] gives the ComputerNumber object equivalent to the ordinary number x in the arithmetic currently in effect.ComputerNumber[sign, mantissa, exp] gives the ...
CellInformation[obj] gives information about selected cells in the notebook represented by the notebook object obj.
GF
(Finite Fields Package Symbol) GF[p, d] gives the Galois field that is a degree d extension of the prime field of p elements.GF[q] gives the Galois field with q elements, for q a prime power.GF[p, ilist] ...
TeleportProbability is an option to PageRanks, PageRankVector, LinkRanks, and LinkRankMatrix that specifies the probability that an internet user may choose to visit a vertex ...
FullReport is an option to hypothesis test functions that specifies whether all report information should be returned.