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 ...
SetPartitionToRGF[sp, set] converts the set partition sp of set into the corresponding restricted growth function.
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. ...
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.
ShowGraph[g] displays the graph g. ShowGraph[g, Directed] is obsolete and it is currently identical to ShowGraph[g].
Strong
(Combinatorica Package Symbol) Strong is an option to ConnectedQ that seeks to determine if a directed graph is strongly connected.
ThickDashed is a value that the option EdgeStyle can take on in the graph data structure or in ShowGraph.
Thick
(Combinatorica Package Symbol) Thick is a value that the option EdgeStyle can take on in the graph data structure or in ShowGraph.
ThinDashed is a value that the option EdgeStyle can take on in the graph data structure or in ShowGraph.