3261 - 3270 of 4620 for listsSearch Results
View search results from all Wolfram sites (17061 matches)
String-Oriented Output Formats   (Mathematica Tutorial)
Text strings. The quotes are not included in standard Mathematica output form. In input form, the quotes are included.
ExposeWidgetReferences   (GUIKit Package Symbol)
ExposeWidgetReferences is an option to Widget which specifies a list of normally internal \:f3b5children widget reference names to include as publicly available instances.
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 ...
Bridges   (Combinatorica Package Symbol)
Bridges[g] gives a list of the bridges of graph g, where each bridge is an edge whose removal disconnects the graph.
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}, ...
CirculantGraph   (Combinatorica Package Symbol)
CirculantGraph[n, l] constructs a circulant graph on n vertices, meaning the i\[Null]^th vertex is adjacent to the (i + j)\[Null]^th and (i - j)\[Null]^th vertices, for each ...
DeleteEdges   (Combinatorica Package Symbol)
DeleteEdges[g, edgeList] gives graph g minus the list of edges edgeList. If g is undirected, then the edges in edgeList are treated as undirected edges; otherwise they are ...
DepthFirstTraversal   (Combinatorica Package Symbol)
DepthFirstTraversal[g, v] performs a depth-first traversal of graph g starting from vertex v, and gives a list of vertices in the order in which they were encountered. ...
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 ...
DilateVertices   (Combinatorica Package Symbol)
DilateVertices[v, d] multiplies each coordinate of each vertex position in list v by d, thus dilating the embedding. DilateVertices[g, d] dilates the embedding of graph g by ...
1 ... 324|325|326|327|328|329|330 ... 462 Previous Next

...