RandomGraph (Combinatorica Package Symbol)

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

ShortestPathSpanningTree (Combinatorica Package Symbol)

ShortestPathSpanningTree[g, v] constructs a shortest-path spanning tree rooted at v, so that a shortest path in graph g from v to any other vertex is a path in the tree.

ToAdjacencyLists (Combinatorica Package Symbol)

ToAdjacencyLists[g] constructs an adjacency list representation for graph g. ToAdjacencyLists[g, EdgeWeight] returns an adjacency list representation along with edge weights.

ToAdjacencyMatrix (Combinatorica Package Symbol)

ToAdjacencyMatrix[g] constructs an adjacency matrix representation for graph g. ToAdjacencyMatrix[g, EdgeWeight] returns edge weights as entries of the adjacency matrix with ...

ToCanonicalSetPartition (Combinatorica Package Symbol)

ToCanonicalSetPartition[sp, set] reorders sp into a canonical order with respect to set. ToCanonicalSetPartition[sp] reorders sp into canonical order, assuming that ...

ToOrderedPairs (Combinatorica Package Symbol)

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

VertexCover (Combinatorica Package Symbol)

VertexCover[g] returns a vertex cover of the graph g.

Geometry` Upgrading Information (Mathematica Compatibility Guide)

LinearAlgebra` Upgrading Information (Mathematica Compatibility Guide)

DelaunayTriangulationQ (Computational Geometry Package Symbol)

DelaunayTriangulationQ[{{x_1, y_1}, {x_2, y_2}, ...}, val] gives True if the triangulation of the points {{x_1, y_1}, ...} represented by the vertex adjacency list val is a ...