501 - 510 of 3808 for FirstSearch Results
View search results from all Wolfram sites (8108 matches)
StronglyConnectedComponents   (Combinatorica Package Symbol)
StronglyConnectedComponents[g] gives the strongly connected components of directed graph g as lists of vertices.
TableauQ   (Combinatorica Package Symbol)
TableauQ[t] yields True if and only if t represents a Young tableau.
Tableaux   (Combinatorica Package Symbol)
Tableaux[p] constructs all tableaux having a shape given by integer partition p.
TransitiveQ   (Combinatorica Package Symbol)
TransitiveQ[g] yields True if graph g defines a transitive relation.
TransitiveReduction   (Combinatorica Package Symbol)
TransitiveReduction[g] finds a smallest graph that has the same transitive closure as g.
TransposeTableau   (Combinatorica Package Symbol)
TransposeTableau[t] reflects a Young tableau t along the main diagonal, creating a different tableau.
TravelingSalesmanBounds   (Combinatorica Package Symbol)
TravelingSalesmanBounds[g] gives upper and lower bounds on a minimum-cost traveling salesman tour of graph g.
TravelingSalesman   (Combinatorica Package Symbol)
TravelingSalesman[g] finds an optimal traveling salesman tour in graph g.
TreeIsomorphismQ   (Combinatorica Package Symbol)
TreeIsomorphismQ[t_1, t_2] yields True if the trees t_1 and t_2 are isomorphic. It yields False otherwise.
TreeQ   (Combinatorica Package Symbol)
TreeQ[g] yields True if graph g is a tree.
1 ... 48|49|50|51|52|53|54 ... 381 Previous Next

...