LongestIncreasingSubsequence[p] finds the longest increasing scattered subsequence of permutation p.

LoopPosition is an option to ShowGraph whose values tell ShowGraph where to position a loop around a vertex. This option can take on values UpperLeft, UpperRight, LowerLeft, ...

LowerLeft is a value that options VertexNumberPosition, VertexLabelPosition, and EdgeLabelPosition can take on in ShowGraph.

LowerRight is a value that options VertexNumberPosition, VertexLabelPosition, and EdgeLabelPosition can take on in ShowGraph.

MakeDirected[g] constructs a directed graph from a given undirected graph g by replacing each undirected edge in g by two directed edges pointing in opposite directions.

MakeGraph[v, f] constructs the graph whose vertices correspond to v and edges between pairs of vertices x and y in v for which the binary relation defined by the Boolean ...

MakeSimple[g] gives the undirected graph, free of multiple edges and self-loops derived from graph g.

MakeUndirected[g] gives the underlying undirected graph of the given directed graph g.

MaximalMatching[g] gives the list of edges associated with a maximal matching of graph g.

MaximumAntichain[g] gives a largest set of unrelated vertices in partial order g.