FindHamiltonianCycle[g] finds a Hamiltonian cycle in the graph g if one exists.

ListCurvePathPlot[{{x_1, y_1}, {x_2, y_2}, ...}] plots a curve that corresponds to a smooth path through the specified points.

Mathematica's unique structure allows a generalized notion of input, in which not only ordinary text, but also typeset structures, diagrams, graphics, control objects and ...

Mathematica supports a variety of coordinate systems, organized for ease and efficiency of both direct and programmatic use. It supports convenient robust automatic range and ...

GraphDistanceMatrix[g] gives a matrix in which the (i, j)\[Null]^th entry is the length of a shortest path in g between vertices i and j.GraphDistanceMatrix[g, Parent] ...

AdjacencyMatrix[g] gives the SparseArray object representing the graph g.AdjacencyMatrix[g, n] gives the SparseArray object representing the graph g, adding additional ...

EventHandler[expr, {"event_1" :> action_1, "event_2" :> action_2, ...}] displays as expr, evaluating action_i whenever "event_i" occurs in connection with expr.

MinCut[g, k] partitions the undirected graph g into k parts where the number of edge cuts is approximately minimized.

NeighborhoodVertices[g, i, r] gives vertices that can be reached from vertex i within r hops.NeighborhoodVertices[g, i] gives vertices that can be reached from vertex i.

NeighborhoodSubgraph[g, i, r] gives a subgraph consists of vertices that can be reached from vertex i within r hops.NeighborhoodSubgraph[g, i] gives a subgraph consists of ...