FunctionalGraph[f, v] takes a set v and a function f from v to v and constructs a directed graph with vertex set v and edges (x, f[x]) for each x in v. FunctionalGraph[{f_1, ...
HamiltonianPath[g] finds a Hamiltonian path in graph g if one exists. HamiltonianPath[g, All] gives all Hamiltonian paths of graph g.
LegendTextSpace is an option for Legend, which specifies the space in the legend box for text.
FindShortestPath[g, s, t] finds the shortest path from source vertex s to target vertex t in the graph g.FindShortestPath[g, s, All] generates a ShortestPathFunction[...] ...
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 ...
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 ...
ChromaticNumber[g] gives the chromatic number of the graph, which is the fewest number of colors necessary to color the graph.
True
(Built-in Mathematica Symbol) True is the symbol for the Boolean value true.
Dashing
(Built-in Mathematica Symbol) Dashing[{r_1, r_2, ...}] is a two-dimensional graphics directive specifying that lines that follow are to be drawn dashed, with successive segments of lengths r_1, r_2, ... ...
FindMinimum[f, x] searches for a local minimum in f, starting from an automatically selected point.FindMinimum[f, {x, x_0}] searches for a local minimum in f, starting from ...