The CCompilerDriver Package lets you work with C compilers that are installed on your computer. It lets you build executables, libraries, and object files from C source code. ...

Cut is a tag that can be used in a call to NetworkFlow to tell it to return the minimum cut.

DeleteVertex[g, v] deletes a single vertex v from graph g. Here v is a vertex number.

Greedy is a value that the option Algorithm can take in calls to functions such as VertexCover, telling the function to use a greedy algorithm.

HeawoodGraph returns a smallest (6, 3)-cage, a 3-regular graph with girth 6.

HerschelGraph returns a graph object that represents a Herschel graph.

MinimumVertexColoring[g] returns a minimum vertex coloring of g. MinimumVertexColoring[g, k] returns a k-coloring of g, if one exists.

ReadGraph[f] reads a graph represented as edge lists from file f and returns a graph object.

RegularGraph[k, n] constructs a semirandom k-regular graph on n vertices, if such a graph exists.

TransposeTableau[t] reflects a Young tableau t along the main diagonal, creating a different tableau.