5621 - 5630 of 8576 for Descartes rule of signsSearch Results
View search results from all Wolfram sites (350119 matches)
List   (GUIKit Package)
Widget["List"] represents a list.
XML Reference   (GUIKit Package Tutorial)
This tutorial documents the XML representation of the user interface definition, GUIKitXML for short. This is a DTD representing the current GUIKit XML definitions. Use the ...
PeakWavelength   (Black Body Radiation Package Symbol)
PeakWavelength[temp] gives the wavelength of the maximum emission of a black body at the specified temperature temp.
BellmanFord   (Combinatorica Package Symbol)
BellmanFord[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 ...
BinarySubsets   (Combinatorica Package Symbol)
BinarySubsets[l] gives all subsets of l ordered according to the binary string defining each subset. For any positive integer n, BinarySubsets[n] gives all subsets of {1, 2, ...
CageGraph   (Combinatorica Package Symbol)
CageGraph[k, r] gives a smallest k-regular graph of girth r for certain small values of k and r. CageGraph[r] gives CageGraph[3, r]. For k = 3, r can be 3, 4, 5, 6, 7, 8, or ...
ChangeEdges   (Combinatorica Package Symbol)
ChangeEdges[g, e] replaces the edges of graph g with the edges in e. e can have the form {{s_1, t_1}, {s_2, t_2}, ...} or the form {{{s_1, t_1}, gr_1}, {{s_2, t_2}, gr_2}, ...
ChangeVertices   (Combinatorica Package Symbol)
ChangeVertices[g, v] replaces the vertices of graph g with the vertices in the given list v. v can have the form {{x_1, y_1}, {x_2, y_2}, ...} or the form {{{x_1, y_1}, ...
CompleteGraph   (Combinatorica Package Symbol)
CompleteGraph[n] creates a complete graph on n vertices. An option Type that takes on the values Directed or Undirected is allowed. The default setting for this option is ...
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 ...
1 ... 560|561|562|563|564|565|566 ... 858 Previous Next

...