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

MakeGraph[v, f] constructs the graph whose vertices correspond to v and edges between pairs of vertices x and y in v for which the binary relation defined by the Boolean ...

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

SetGraphOptions[g, opts] returns g with the options opts set. SetGraphOptions[g, {v_1, v_2, ..., v_opts}, g_opts] returns the graph with the options v_opts set for vertices ...

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.

ToAdjacencyLists[g] constructs an adjacency list representation for graph g. ToAdjacencyLists[g, EdgeWeight] returns an adjacency list representation along with edge weights.

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

SymbolicExpressionMLToExpression[expr] takes a SymbolicXML expression expr that represents an ExpressionML document and returns the corresponding expression.