GreedyVertexCover[g] returns a vertex cover of graph g constructed using the greedy algorithm. This is a natural heuristic for constructing a vertex cover, but it can produce ...

HamiltonianCycle[g] finds a Hamiltonian cycle in graph g if one exists. HamiltonianCycle[g, All] gives all Hamiltonian cycles of graph g.

InsertIntoTableau[e, t] inserts integer e into Young tableau t using the bumping algorithm. InsertIntoTableau[e, t, All] inserts e into Young tableau t and returns the new ...

KSubsets[l, k] gives all subsets of set l containing exactly k elements, ordered lexicographically.

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

MinimumSpanningTree[g] uses Kruskal's algorithm to find a minimum spanning tree of graph g.

MinimumVertexCover[g] finds a minimum vertex cover of graph g.

M[g] gives the number of edges in the graph g. M[g, Directed] is obsolete because M[g] works for directed as well as undirected graphs.

NumberOfTableaux[p] uses the hook length formula to count the number of Young tableaux with shape defined by partition p.

OrientGraph[g] assigns a direction to each edge of a bridgeless, undirected graph g, so that the graph is strongly connected.