SetPartitionToRGF[sp, set] converts the set partition sp of set into the corresponding restricted growth function.

SetVertexLabels[g, l] assigns the labels in l to vertices of g.

SetVertexWeights[g] assigns random real weights in the range [0, 1] to vertices in g. SetVertexWeights[g, w] assigns the weights in the weight list w to the vertices of g. ...

ShakeGraph[g, d] performs a random perturbation of the vertices of graph g, with each vertex moving, at most, a distance d from its original position.

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.

ShowGraphArray[{g_1, g_2, ...}] displays a row of graphs. ShowGraphArray[{{g_1, ...}, {g_2, ...}, \ ...}] displays a two-dimensional table of graphs.

ShowGraph[g] displays the graph g. ShowGraph[g, Directed] is obsolete and it is currently identical to ShowGraph[g].

ShowLabeledGraph[g] displays graph g according to its embedding, with each vertex labeled with its vertex number.ShowLabeledGraph[g, l] uses the i\[Null]^th element of list l ...

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