VertexCount[g] gives a count of the number of vertices in the graph g.VertexCount[g, patt] gives a count of the number of vertices that match the pattern patt.

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

BellmanFord[g, v] gives a shortest-path spanning tree and associated distances from vertex v of graph g. The shortest-path spanning tree is given by a list in which element i ...

ChangeVertices[g, v] replaces the vertices of graph g with the vertices in the given list v. v can have the form {{x_1, y_1}, {x_2, y_2}, ...} or the form {{{x_1, y_1}, ...

DepthFirstTraversal[g, v] performs a depth-first traversal of graph g starting from vertex v, and gives a list of vertices in the order in which they were encountered. ...

Dijkstra[g, v] gives a shortest-path spanning tree and associated distances from vertex v of graph g. The shortest-path spanning tree is given by a list in which element i is ...

ListNecklaces[n, c, Cyclic] returns all distinct necklaces whose beads are colored by colors from c. Here c is a list of n, not necessarily distinct colors, and two colored ...

ToUnorderedPairs[g] constructs a list of unordered pairs representing the edges of graph g. Each edge, directed or undirected, results in a pair in which the smaller vertex ...

DelaunayTriangulation[{{x_1, y_1}, {x_2, y_2}, ...}] yields the planar Delaunay triangulation of the points {{x_1, y_1}, ...}.

HighlightStyle is an option for DendrogramPlot that specifies the style for highlighted clusters.