PairGroupIndex (Combinatorica Package Symbol)

PairGroupIndex[g, x] returns the cycle index of the pair group induced by g as a polynomial in x[1], x[2], ....PairGroupIndex[ci, x] takes the cycle index ci of a group g ...

PartitionLattice (Combinatorica Package Symbol)

PartitionLattice[n] returns a Hasse diagram of the partially ordered set on set partitions of 1 through n in which p < q if q is finer than p, that is, each block in q is ...

RandomGraph (Combinatorica Package Symbol)

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

RankedEmbedding (Combinatorica Package Symbol)

RankedEmbedding[l] takes a set partition l of vertices {1, 2, ..., n} and returns an embedding of the vertices in the plane such that the vertices in each block occur on a ...

SetGraphOptions (Combinatorica Package Symbol)

SetGraphOptions[g, opts] returns g with the options opts set. SetGraphOptions[g, {v_1, v_2, ..., v_opts}, g_opts] returns the graph with the options v_opts set for vertices ...

SetVertexWeights (Combinatorica Package Symbol)

SetVertexWeights[g] assigns random real weights in the range [0, 1] to vertices in g. SetVertexWeights[g, w] assigns the weights in the weight list w to the vertices of g. ...

ShortestPath (Combinatorica Package Symbol)

ShortestPath[g, start, end] finds a shortest path between vertices start and end in graph g.

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.

ShowGraph (Combinatorica Package Symbol)

ShowGraph[g] displays the graph g. ShowGraph[g, Directed] is obsolete and it is currently identical to ShowGraph[g].

ShuffleExchangeGraph (Combinatorica Package Symbol)

ShuffleExchangeGraph[n] returns the n-dimensional shuffle-exchange graph whose vertices are length n binary strings with an edge from w to Derivative[1][w] if (i) ...