DeleteEdges (Combinatorica Package Symbol)

DeleteEdges[g, edgeList] gives graph g minus the list of edges edgeList. If g is undirected, then the edges in edgeList are treated as undirected edges; otherwise they are ...

DepthFirstTraversal (Combinatorica Package Symbol)

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 (Combinatorica Package Symbol)

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 (Combinatorica Package Symbol)

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

OrbitInventory (Combinatorica Package Symbol)

OrbitInventory[ci, x, w] returns the value of the cycle index ci when each formal variable x[i] is replaced by w. OrbitInventory[ci, x, weights] returns the inventory of ...

ToOrderedPairs (Combinatorica Package Symbol)

ToOrderedPairs[g] constructs a list of ordered pairs representing the edges of the graph g.

ToUnorderedPairs (Combinatorica Package Symbol)

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 (Computational Geometry Package Symbol)

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

Hull (Computational Geometry Package Symbol)

Hull is an option to DelaunayTriangulation that specifies whether the convex hull hull is to be returned in addition to the vertex adjacency list val describing the ...

TriangularSurfacePlot (Computational Geometry Package Symbol)

TriangularSurfacePlot[{{x_1, y_1, z_1}, {x_2, y_2, z_2}, ...}] plots the surface according to the Delaunay triangulation established by projecting the points onto the x-y ...