291 - 300 of 724 for GraphSearch Results
View search results from all Wolfram sites (12491 matches)
TravelingSalesman   (Combinatorica Package Symbol)
TravelingSalesman[g] finds an optimal traveling salesman tour in graph g.
TriangleInequalityQ   (Combinatorica Package Symbol)
TriangleInequalityQ[g] yields True if the weights assigned to the edges of graph g satisfy the triangle inequality.
V   (Combinatorica Package Symbol)
V[g] gives the order or number of vertices of the graph g.
WriteGraph   (Combinatorica Package Symbol)
WriteGraph[g, f] writes graph g to file f using an edge list representation.
Cycle   (Combinatorica Package Symbol)
Cycle[n] constructs the cycle on n vertices, the 2-regular connected graph. An option Type that takes on values Directed or Undirected is allowed. The default setting is Type ...
ShowLabeledGraph   (Combinatorica Package Symbol)
ShowLabeledGraph[g] displays graph g according to its embedding, with each vertex labeled with its vertex number.ShowLabeledGraph[g, l] uses the i\[Null]^th element of list l ...
TransitiveClosure   (Combinatorica Package Symbol)
TransitiveClosure[g] finds the transitive closure of graph g, the supergraph of g that contains edge {x, y} if and only if there is a path from x to y.
RandomGraph   (Combinatorica Package Symbol)
RandomGraph[n, p] constructs a random labeled graph on n vertices with an edge probability of p.
HerschelGraph   (Combinatorica Package Symbol)
HerschelGraph returns a graph object that represents a Herschel graph.
M   (Combinatorica Package Symbol)
M[g] gives the number of edges in the graph g. M[g, Directed] is obsolete because M[g] works for directed as well as undirected graphs.
1 ... 27|28|29|30|31|32|33 ... 73 Previous Next

...