DilateVertices[v, d] multiplies each coordinate of each vertex position in list v by d, thus dilating the embedding. DilateVertices[g, d] dilates the embedding of graph g by ...

ButcherTreeCount[p] gives a list of the number of trees through order p.

ButcherTrees[p] gives a list, partitioned by order, of the trees for any Runge\[Dash]Kutta method of order p.

CopyDirectory["dir_1", "dir_2"] copies the directory dir_1 to dir_2.

EulerSum[f, {i, i_min, i_max}] gives a numerical approximation to the sum \[Sum]i = i_min i_max f using Euler's transformation.EulerSum[f, {i, i_min, i_max, di}] uses a step ...

MakeJavaObject[expr] constructs a new Java object whose "value" is expr.

AlternatingPaths[g, start, ME] returns the alternating paths in graph g with respect to the matching ME, starting at the vertices in the list start. The paths are returned in ...

ArticulationVertices[g] gives a list of all articulation vertices in graph g. These are vertices whose removal will disconnect the graph.

FindCycle[g] finds a list of vertices that define a cycle in graph g.

RotateVertices[v, \[Theta]] rotates each vertex position in list v by \[Theta] radians about the origin (0, 0). RotateVertices[g, \[Theta]] rotates the embedding of the graph ...