SelectionSort[l, f] sorts list l using ordering function f.

Spectrum[g] gives the eigenvalues of graph g.

Strong is an option to ConnectedQ that seeks to determine if a directed graph is strongly connected.

SymmetricGroup[n] returns the symmetric group on n symbols.

TetrahedralGraph returns the graph corresponding to the tetrahedron, a Platonic solid.

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

ToInversionVector[p] gives the inversion vector associated with permutation p.

Tree is an option that informs certain functions that the user wants the output to be a tree.

UndirectedQ[g] yields True if graph g is undirected.