InversionPoset[n] returns a Hasse diagram of the partially ordered set on size-n permutations in which p < q if q can be obtained from p by an adjacent transposition that ...

Isomorphism[g, h] gives an isomorphism between graphs g and h if one exists. Isomorphism[g, h, All] gives all isomorphisms between graphs g and h. Isomorphism[g] gives the ...

PartitionLattice[n] returns a Hasse diagram of the partially ordered set on set partitions of 1 through n in which p < q if q is finer than p, that is, each block in q is ...

RandomGraph[n, p] constructs a random labeled graph on n vertices with an edge probability of p.

ShortestPath[g, start, end] finds a shortest path between vertices start and end in graph g.

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