CellularAutomaton[rule, init, t] generates a list representing the evolution of the cellular automaton with the specified rule from initial condition init for t steps. ...

TransitiveClosure[g] finds the transitive closure of graph g, the supergraph of g that contains edge {x, y} if and only if there is a path from x to y.

GridGraph[n, m] constructs an n*m grid graph, the product of paths on n and m vertices. GridGraph[p, q, r] constructs a p*q*r grid graph, the product of GridGraph[p, q] and a ...

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

FromAdjacencyLists[l] constructs an edge list representation for a graph from the given adjacency lists l, using a circular embedding. FromAdjacencyLists[l, v] uses v as the ...

RandomGraph[n, p] constructs a random labeled graph on n vertices with an edge probability of p.

IndependentVertexSetQ[g, vlist] yields True if the vertex list vlist is an independent vertex set in the graph g and False otherwise.

ViewPoint is an option for Graphics3D and related functions which gives the point in space from which three-dimensional objects are to be viewed.

VertexRenderingFunction is an option for GraphPlot and related functions that gives a function to generate the graphics primitives to use in rendering each vertex.

VertexEccentricity[g, s] gives the length of the longest shortest path from the source s to every other vertex in the graph g.