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.

All functionality is available in the newly created Statistical Plots Package. SymbolShape and SymbolStyle options are replaced by PlotMarkers. PlotJoined option is replaced ...

TrekGenerator is an option to EquationTrekker that specifies the method used to generate treks.

OrderStarInterpolation is an option to OrderStarPlot that specifies whether interpolation points of an approximant to a function should be displayed.