AI & ChatGPT searches , social queriess for SPANNING TREE
Search references for SPANNING TREE. Phrases containing SPANNING TREE
See searches and references containing SPANNING TREE!
Search references for SPANNING TREE. Phrases containing SPANNING TREE
See searches and references containing SPANNING TREE!SPANNING TREE
Network protocol that builds a loop-free logical topology for Ethernet networks
The Spanning Tree Protocol (STP) is a network protocol that builds a loop-free logical topology for Ethernet networks. The basic function of STP is to
Spanning_Tree_Protocol
Tree which includes all vertices of a graph
graph may have several spanning trees, but a graph that is not connected will not contain a spanning tree (see about spanning forests below). If all of
Spanning_tree
Least-weight tree connecting graph vertices
minimum spanning forest, which is a union of the minimum spanning trees for its connected components. There are many use cases for minimum spanning trees. One
Minimum_spanning_tree
Network protocol that builds a loop-free logical topology for Ethernet networks
Wikimedia Commons has media related to Multiple Spanning Tree Protocol. The Multiple Spanning Tree Protocol (MSTP) and algorithm, provides both simple
Multiple Spanning Tree Protocol
Multiple_Spanning_Tree_Protocol
Topics referred to by the same term
Look up spanning tree in Wiktionary, the free dictionary. Spanning tree is a term in the mathematical field of graph theory Spanning tree may also refer
Spanning tree (disambiguation)
Spanning_tree_(disambiguation)
Model for a random simple path
spanning tree of G is a subgraph of G containing all vertices and some of the edges, which is a tree, i.e. connected and with no cycles. A spanning tree
Loop-erased_random_walk
Minimum-cost tree with exactly k vertices
The k-minimum spanning tree problem, studied in theoretical computer science, asks for a tree of minimum cost that has exactly k vertices and forms a
K-minimum_spanning_tree
Graph theory concept
In graph theory, a minimum degree spanning tree is a subset of the edges of a connected graph that connects all the vertices together, without any cycles
Minimum_degree_spanning_tree
Topics referred to by the same term
Linear spanning, a concept in abstract algebra Spanning tree, a subgraph which is a tree, containing all the vertices of a graph Søren Spanning (1951–2020)
Spanning
Shortest network connecting points
A Euclidean minimum spanning tree of a finite set of points in the Euclidean plane or higher-dimensional Euclidean space connects the points by a system
Euclidean minimum spanning tree
Euclidean_minimum_spanning_tree
Kinetic data structure
A kinetic minimum spanning tree is a kinetic data structure that maintains the minimum spanning tree (MST) of a graph whose edge weights are changing as
Kinetic_minimum_spanning_tree
On short connecting nets with added points
the (non-negative) shortest path problem and the minimum spanning tree problem. If a Steiner tree problem in graphs contains exactly two terminals, it reduces
Steiner_tree_problem
In mathematics, a random minimum spanning tree may be formed by assigning independent random weights from some distribution to the edges of an undirected
Random_minimum_spanning_tree
Device that creates a larger computer network from two smaller networks
mitigated using a spanning tree protocol or a more intelligent forwarding algorithm like Shortest Path Bridging or TRILL. A spanning tree protocol is a distributed
Network_bridge
American software designer and network engineer
now know as the Internet. She is most famous for her invention of the Spanning Tree Protocol (STP), which is fundamental to the operation of network bridges
Radia_Perlman
Area of discrete mathematics
selected. Being a spanning tree means that a subgraph is a tree that includes all of the vertices of a graph. The uniform spanning tree can be generated
Graph_theory
minimum spanning tree (RMST) of a set of n points in the plane (or more generally, in R d {\displaystyle \mathbb {R} ^{d}} ) is a minimum spanning tree of
Rectilinear minimum spanning tree
Rectilinear_minimum_spanning_tree
Generalization of depth-first search trees
theory, a Trémaux tree of an undirected graph G {\displaystyle G} is a type of spanning tree, generalizing depth-first search trees. They are defined
Trémaux_tree
Bottleneck Spanning Arborescence (MBSA). In an undirected graph G(V, E) and a function w : E → R, let S be the set of all spanning trees Ti. Let B(Ti)
Minimum bottleneck spanning tree
Minimum_bottleneck_spanning_tree
Undirected, connected, and acyclic graph
count spanning trees in an undirected graph, which is addressed by the matrix tree theorem. (Cayley's formula is the special case of spanning trees in a
Tree_(graph_theory)
Tree connecting given points by short paths
minimum-diameter spanning tree of a finite set of points in a metric space is a spanning tree in which the diameter (the longest path length in the tree between
Minimum-diameter spanning tree
Minimum-diameter_spanning_tree
Type of spanning tree
degree-constrained spanning tree is a spanning tree where the maximum vertex degree is limited to a certain constant k. The degree-constrained spanning tree problem
Degree-constrained spanning tree
Degree-constrained_spanning_tree
The distributed minimum spanning tree (MST) problem involves the construction of a minimum spanning tree by a distributed algorithm, in a network where
Distributed minimum spanning tree
Distributed_minimum_spanning_tree
the edges of which is lowest among all spanning trees of G {\displaystyle G} , is called a minimum spanning tree (MST). It is not necessarily unique. More
Parallel algorithms for minimum spanning trees
Parallel_algorithms_for_minimum_spanning_trees
weights are computed as the difference of pixel intensities. A minimum spanning tree (MST) is a minimum-weight, cycle-free subset of a graph's edges such
Minimum spanning tree-based segmentation
Minimum_spanning_tree-based_segmentation
Concept in graph theory
good spanning tree T {\displaystyle T} of an embedded planar graph G {\displaystyle G} is a rooted spanning tree of G {\displaystyle G} whose non-tree edges
Good_spanning_tree
Index of articles associated with the same name
random tree is a tree or arborescence that is formed by a stochastic process. Types of random trees include: Uniform spanning tree, a spanning tree of a
Random_tree
Method for finding minimum spanning trees
minimum spanning forest in a possibly disconnected graph; in contrast, the most basic form of Prim's algorithm only finds minimum spanning trees in connected
Prim's_algorithm
algorithm can only be applied to unweighted graphs. A minimum spanning tree is a tree-like subgraph of a given graph G, in which it keeps all the nodes
Disparity filter algorithm of weighted network
Disparity_filter_algorithm_of_weighted_network
Minimum spanning forest algorithm that greedily adds edges
algorithm finds a minimum spanning forest of an undirected edge-weighted graph. If the graph is connected, it finds a minimum spanning tree. It is a greedy algorithm
Kruskal's_algorithm
Spanning tree type
Capacitated minimum spanning tree is a minimal cost spanning tree of a graph that has a designated root node r {\displaystyle r} and satisfies the capacity
Capacitated minimum spanning tree
Capacitated_minimum_spanning_tree
Graph representing faces of another graph
in which the tree structure of the walls forms a spanning tree of the graph and the tree structure of the free space forms a spanning tree of the dual
Dual_graph
Binary tree derived from a sequence of numbers
path weight in the minimum spanning tree of the metric. From the minimum spanning tree, one can construct a Cartesian tree, the root node of which represents
Cartesian_tree
Classification of algorithm
for an Expected Linear-Time Minimum Spanning Tree Algorithm(Karger-Klein-Tarjan + Hagerup Minimum Spanning Tree Verification as a sub-routine)". GitHub
Galactic_algorithm
matching Bandwidth problem Bipartite dimension Capacitated minimum spanning tree Route inspection problem (also called Chinese postman problem) for mixed
List_of_NP-complete_problems
A kinetic Euclidean minimum spanning tree is a kinetic data structure that maintains the Euclidean minimum spanning tree (EMST) of a set P of n points
Kinetic Euclidean minimum spanning tree
Kinetic_Euclidean_minimum_spanning_tree
Formula in graph theory
of spanning trees t ( G ) {\displaystyle t(G)} satisfies DC. Proof. t ( G ∖ e ) {\displaystyle t(G\setminus e)} denotes the number of spanning trees not
Deletion–contraction_formula
A minimum-cost spanning-tree game (MCST game) is a kind of a cooperative game. In an MCST game, each player is a node in a complete graph. The graph contains
Minimum-cost spanning tree game
Minimum-cost_spanning_tree_game
Algorithm to search the nodes of a graph
conveniently described in terms of a spanning tree of the vertices reached during the search. Based on this spanning tree, the edges of the original graph
Depth-first_search
On the number of spanning trees in a graph
theory, Kirchhoff's theorem or Kirchhoff's matrix tree theorem is a theorem about the number of spanning trees in a graph. It states that this number can be
Kirchhoff's_theorem
NP-hard problem in combinatorial optimization
example, the minimum spanning tree of the graph associated with an instance of the Euclidean TSP is a Euclidean minimum spanning tree, and so can be computed
Travelling_salesman_problem
Automated methods for the creation of mazes
of this, maze generation is often approached as generating a random spanning tree. Loops, which can confound naive maze solvers, may be introduced by
Maze_generation_algorithm
tree theorem is an expression for the stationary distribution of a Markov chain with finitely many states. It sums up terms for the rooted spanning trees
Markov_chain_tree_theorem
Spanning tree minimizing sum of distances
distance spanning tree, shortest total path length spanning tree, minimum total distance spanning tree, or minimum average distance spanning tree. In an
Minimum routing cost spanning tree
Minimum_routing_cost_spanning_tree
Dominating set that induces a connected subgraph
In graph theory, a connected dominating set and a maximum leaf spanning tree are two closely related structures defined on an undirected graph. A connected
Connected_dominating_set
Sequence of locally optimal choices
and Prim's algorithm are greedy algorithms for constructing minimum spanning trees of a given connected graph. They always find an optimal solution, which
Greedy_algorithm
Algorithm for the directed version of the minimum spanning tree problem
finding a spanning arborescence of minimum weight (sometimes called an optimum branching). It is the directed analog of the minimum spanning tree problem
Edmonds'_algorithm
IEEE standard for Shortest Path Bridging
while enabling multipath routing. SPB is designed to replace the older Spanning Tree Protocols: IEEE 802.1D STP, IEEE 802.1w RSTP, and IEEE 802.1s MSTP.
IEEE_802.1aq
Algorithm for finding shortest paths
machine's back panel. As a solution, he re-discovered Prim's minimal spanning tree algorithm (known earlier to Jarník, and also rediscovered by Prim).
Dijkstra's_algorithm
Data structure for storing non-overlapping sets
Kruskal's algorithm for finding the minimum spanning tree of a graph. The importance of minimum spanning trees means that disjoint-set data structures support
Disjoint-set_data_structure
Probability distribution on equally likely outcomes
set and a uniform spanning tree of a graph is a spanning tree selected with uniform probabilities from the full set of spanning trees of the graph. The
Discrete_uniform_distribution
Standard which includes bridging, Spanning Tree Protocol and others
802.1D is the Ethernet MAC bridges standard which includes bridging, Spanning Tree Protocol and others. It is standardized by the IEEE 802.1 working group
IEEE_802.1D
Subfield of mathematical optimization
optimization problems are the travelling salesman problem ("TSP"), the minimum spanning tree problem ("MST"), and the knapsack problem. In many such problems, such
Combinatorial_optimization
Solution in cooperative games
constructing dynamic-programming based separation oracles. In a minimum-cost spanning-tree game, each player is a node in a complete graph. The graph contains
Nucleolus_(game_theory)
Abstract data type in computer science
Using min heap priority queue in Prim's algorithm to find the minimum spanning tree of a connected and undirected graph, one can achieve a good running
Priority_queue
Machine learning algorithm
maximum-weight spanning tree of the clique graph is a junction tree. So, to construct a junction tree we just have to extract a maximum weight spanning tree out
Junction_tree_algorithm
Standard that adapts Ethernet technology to carrier class transport networks
in eliminating flooding, dynamically created forwarding tables, and spanning tree protocols. Compared to PBB and its predecessors, PBB-TE behaves more
Provider Backbone Bridge Traffic Engineering
Provider_Backbone_Bridge_Traffic_Engineering
Method for finding minimum spanning trees
algorithm is a greedy algorithm for finding a minimum spanning tree in a graph, or a minimum spanning forest in the case of a graph that is not connected
Borůvka's_algorithm
IEEE networking standard supporting VLANs
the IEEE 802.1D-2004 standard, which originally defined bridging and Spanning Tree Protocol. 802.1Q adds a 32-bit field between the source MAC address
IEEE_802.1Q
Graph with at most one cycle per component
augmented trees and maximal pseudoforests are also sometimes called augmented forests. The minimum spanning pseudoforest problem involves finding a spanning pseudoforest
Pseudoforest
Approximation for the travelling salesman problem
algorithm can be described in pseudocode as follows. Create a minimum spanning tree T of G. Let O be the set of vertices with odd degree in T. By the handshaking
Christofides_algorithm
Unsolved problem in graph theory
unproven conjecture on the ratio of lengths of Steiner trees and Euclidean minimum spanning trees for the same point sets in the Euclidean plane. It was
Gilbert–Pollak_conjecture
Minimum spanning forest algorithm that greedily deletes edges
algorithm is an algorithm in graph theory used to obtain a minimum spanning tree from a given connected, edge-weighted graph. It first appeared in Kruskal
Reverse-delete_algorithm
Axiom of set theory
a spanning tree; equivalently, every tree in a connected graph can be extended to a spanning tree, while every spanning subgraph contains a spanning tree
Axiom_of_choice
Length of a line segment
the squared Euclidean distance. For instance, the Euclidean minimum spanning tree can be determined using only the ordering between distances, and not
Euclidean_distance
its minimum spanning forest F. Remove all F-heavy edges from G' (where F is the forest from step 3) using a linear time minimum spanning tree verification
Expected linear time MST algorithm
Expected_linear_time_MST_algorithm
Type of spanning tree
computer science, a shortest-path tree rooted at a vertex v of a connected, undirected graph G is a spanning tree T of G, such that the path distance
Shortest-path_tree
Type of link aggregation group optimised for redundancy
configuration is superior to Spanning Tree Protocol as the load can be shared across all links during normal operation, whereas Spanning Tree Protocol must disable
Multi-chassis link aggregation group
Multi-chassis_link_aggregation_group
(proximities) involved first generating a network framework. Here, the maximum spanning tree (MST) algorithm built a network of the 775 product nodes and the 774
The_Product_Space
Theorem on edge-disjoint spanning trees
theory, the Nash-Williams theorem is a tree-packing theorem that describes how many edge-disjoint spanning trees (and more generally forests) a graph can
Nash-Williams_theorem
Topics referred to by the same term
RSTP or Rstp may refer to: Rapid Spanning Tree Protocol, a computer network protocol Redstone Solar Thermal Power, a solar power tower in South Africa
RSTP
Data structure
A top tree is a data structure based on a binary tree for unrooted dynamic trees that is used mainly for various path-related operations. It allows simple
Top_tree
Logical layer-3 interface on a multilayer network switch
provide an access layer - 'Routed Access' Configuration (in lieu of Spanning Tree Protocol) Advantages include: Much faster than router-on-a-stick, because
Switch_virtual_interface
Problem optimization method
− 1) + fib(n − 2) Notice that if we call, say, fib(5), we produce a call tree that calls the function on the same value many different times: fib(5) fib(4)
Dynamic_programming
Cycles in a graph that generate all cycles
formed from any spanning tree or spanning forest of the given graph, by selecting the cycles formed by the combination of a path in the tree and a single
Cycle_basis
Network protocol for Ethernet that provides seamless failover
applications, the recovery time of commonly used protocols such as the Rapid Spanning Tree Protocol (RSTP) is too long. It has been adopted for electrical substation
High-availability Seamless Redundancy
High-availability_Seamless_Redundancy
Computational technique
the trajectory Monocle computes a minimum spanning tree, then finds the longest connected path in that tree. Cells are projected onto the nearest point
Trajectory_inference
Concept in probability theory
Schramm (2000) as a conjectured scaling limit of the planar uniform spanning tree (UST) and the planar loop-erased random walk (LERW) probabilistic processes
Schramm–Loewner_evolution
Networking hardware that forwards packets based on hardware address
regulated using the Spanning Tree Protocol (STP) that disables forwarding on links so that the resulting local area network is a tree without switching
Network_switch
Topics referred to by the same term
of Stratification Concrete syntax tree Common spanning tree, a networking concept used by the Multiple Spanning Tree Protocol Computer Simulation Technology
CST
Stochastic point process in mathematics
unit flow along e onto the subspace of ℓ2(E) spanned by star flows. Then the uniformly random spanning tree of G is a determinantal point process on E,
Determinantal_point_process
Combined bridging and routing protocol
the bridge protocol data units of the Spanning Tree Protocol. TRILL was designed as a successor to the Spanning Tree Protocol, both having been created by
TRILL
Network protocol standard for Ethernet seamless failover
applications, the recovery time of commonly used protocols such as the Rapid Spanning Tree Protocol (RSTP) is too long. The cost of PRP is a duplication of all
Parallel_Redundancy_Protocol
Edge-joined polygons which fold into a polyhedron
convex polyhedron to form a net must form a spanning tree of the polyhedron, but cutting some spanning trees may cause the polyhedron to self-overlap when
Net_(polyhedron)
Mathematical sequence
d_{i}-1} times. Cayley's formula can be generalized: a labeled tree is in fact a spanning tree of the labeled complete graph. By placing restrictions on the
Prüfer_sequence
French computer scientist (born 1955)
asymptotically efficient known deterministic algorithm for finding minimum spanning trees. Chazelle was born in Clamart, France, the son of Marie-Claire (née
Bernard_Chazelle
Part of the mathematical subject of group theory
groupoids. The algebraic definition is easier to state: First, choose a spanning tree T in A. The fundamental group of A with respect to T, denoted π1(A,
Bass–Serre_theory
Collective perception of a group of people
wisdom-of-the-crowds effects include: Combinatorial problems such as minimum spanning trees and the traveling salesman problem, in which participants must find
Wisdom_of_the_crowd
there is a path between every two nodes u and v (that is, S contains a spanning tree of G). For each feasible network S, the total cost of S is the sum,
Optimal_network_design
Computer networking technology
networking features in switches use Shortest Path Bridging (SPB) or the Spanning Tree Protocol (STP) to maintain a loop-free, meshed network, allowing physical
Ethernet
approximation. spanning A subgraph is spanning when it includes all of the vertices of the given graph. Important cases include spanning trees, spanning subgraphs
Glossary_of_graph_theory
Czech academic and mathematician
mathematically as a minimum spanning tree problem, and described the first known algorithm for finding the minimum spanning tree of a metric space (the set
Otakar_Borůvka
objects to be generated into a spanning tree of their state space, and then performing a depth-first search of this tree. Reverse-search algorithms were
Reverse-search_algorithm
A tree k-spanner (or simply k-spanner) of a graph G {\displaystyle G} is a spanning subtree T {\displaystyle T} of G {\displaystyle G} in which the distance
Tree_spanner
Detection of half-working Ethernet links
configuration of cables and detect unidirectional links. UDLD complements the Spanning Tree Protocol which is used to eliminate switching loops. Unidirectional
Unidirectional_Link_Detection
Theorem that every subgroup of a free group is itself free
concatenating a spanning tree path from a base point (the coset of the identity) to one of the cosets, a single non-tree edge, and an inverse spanning tree path
Nielsen–Schreier_theorem
Fault recovery system for Ethernet
single failure with recovery time much faster than achievable with Spanning Tree Protocol. It is suitable to most industrial Ethernet applications. MRP
Media_Redundancy_Protocol
Graph generated by a random process
number of tree components of order k is asymptotically Poisson. Types of random trees include uniform spanning tree, random minimum spanning tree, random
Random_graph
American mathematician
Minimal spanning trees have applications to the construction and pricing of communication networks. In combinatorics, he is known for Kruskal's tree theorem
Joseph_Kruskal
Characterization of planar graphs by matroids
subset T of E forms a spanning tree of G if and only if the edges corresponding to the complementary subset E − T form a spanning tree of G′. An equivalent
Whitney's_planarity_criterion
SPANNING TREE
SPANNING TREE
Surname or Lastname
English
English : variant of Fenning.
Girl/Female
American, Australian, British, English
Wise; Knowing
Boy/Male
American, British, Christian, English, French, Indian, Irish
Wise; Knowing; Occupational Name; Official of the Church; Young Wolf; A Canon
Male
English
A Canon
Surname or Lastname
English
English : unexplained.German : patronymic from a personal name formed with Ban- ‘decree’, ‘command’ or Band- ‘band’, ‘tie’.
Boy/Male
English
From the split meadow.
Boy/Male
English American
Son of a hero.
Surname or Lastname
Irish
Irish : variant of Cannan.English : habitational name from a place in Wiltshire called Cannings, apparently named with the Old English byname Cana (of uncertain origin) + -ingas ‘people of’.
Boy/Male
Irish American English French
Young wolf.
Surname or Lastname
English
English : nickname from a diminutive of Middle English sparewe ‘sparrow’ (see Sparrow).Altered form of German Sperling.
Boy/Male
Gaelic English Anglo Saxon
Little blond one.
Surname or Lastname
English
English : unexplained. Perhaps a variant of Channon.The earliest American Channing was John, who came from Dorset, England, in 1711 with his wife. Their son John became a prosperous merchant of Newport, RI, and their grandson William Ellery was born there in 1780. William Ellery Channing (1780–1842) was a Unitarian clergyman who founded the Massachusetts Peace Society, a precursor of the modern anti-war movement.
Surname or Lastname
English and Scottish
English and Scottish : habitational name from a place in Lincolnshire, so called from the Old English tribal name Spaldingas ‘people of the district called Spald’. The district name probably means ‘ditches’, referring to drainage channels in the fenland.The surname was taken to Scotland in the 13th century by Radulphus de Spalding. His descendants prospered, and the name is still common in Scotland. Early American Spaldings include Thomas Spalding, born in Frederica, GA, in 1774, who introduced sea-island cotton in GA, and the physician Lyman Spalding, born in Cornish, NH, in 1775, who founded U.S. Pharmacopoeia.
Boy/Male
Anglo, British, English
From the Divided Field
Boy/Male
French
Church official.
Surname or Lastname
English, Dutch, and North German
English, Dutch, and North German : from early Middle English penning, Low German penning, Middle Dutch penninc ‘penny’ (see Penny), a topographic name (from a field name) or a nickname referring to tax dues of a penny.South German : from the short form, Panno, of a Germanic personal name derived from a word meaning ‘ban’, ‘order’, ‘command’.
Surname or Lastname
English (Dorset and Somerset)
English (Dorset and Somerset) : unexplained.Dutch : patronymic from a short form of the personal name Julianus (see Julian).
Surname or Lastname
English (chiefly Sussex)
English (chiefly Sussex) : variant of Standen, or a habitational name from a place in Lancashire with the same etymology.
Surname or Lastname
English
English : patronymic from Mann 1 and 2.Irish : adopted as an English equivalent of Gaelic Ó MainnÃn ‘descendant of MainnÃn’, probably an assimilated form of MainchÃn, a diminutive of manach ‘monk’. This is the name of a chieftain family in Connacht. It is sometimes pronounced Ó MaingÃn and Anglicized as Mangan.Anstice Manning, widow of Richard Manning of Dartmouth, England, came to MA with her children in 1679. Her great-great-grandson Robert, born at Salem, MA, in 1784, was the uncle and protector of author Nathaniel Hawthorne. Another early bearer of the relatively common British name was Jeffrey Manning, one of the earliest settlers in Piscataway township, Middlesex Co., NJ. His great-grandson James Manning (1738–91) was a founder and the first president of Rhode Island College (Brown University).
Boy/Male
Hindu
Old, Wise, River
SPANNING TREE
SPANNING TREE
Girl/Female
Tamil
Darminee | தரà¯à®®à¯€à®¨à¯€
Religious
Girl/Female
Indian, Punjabi, Sikh
Forehead
Girl/Female
Hindu, Indian, Traditional
Invisible
Girl/Female
Tamil
Saagnika | ஸாகà¯à®¨à¯€à®•à®¾
Fiery, Passionate, Married, With fire
Boy/Male
American, British, Chinese, Christian, English, German, Swedish
Defender of Mankind; Abbreviation of Alexander; Man Defender
Boy/Male
Muslim
Green or green crop connoting freshness and innocence, Powerful (1)
Female
Polish
Czech and Polish form of Greek Zoe, ZOJA means "life."
Girl/Female
German, Irish
Sweet; Melodious
Boy/Male
Indian, Telugu
Lovely; Good Friend; Well Measured
Boy/Male
Hindu, Indian, Punjabi, Sikh, Traditional
Lamp of God's Grace
SPANNING TREE
SPANNING TREE
SPANNING TREE
SPANNING TREE
SPANNING TREE
p. pr. & vb. n.
of Spank
n.
Maintenance of position; duration; duration or existence in the same place or condition; continuance; as, a custom of long standing; an officer of long standing.
a.
Not movable; fixed; as, a standing bed (distinguished from a trundle-bed).
p. pr. & vb. n.
of Span
a.
Large; considerable.
n.
Sparling.
n.
Condition in society; relative position; reputation; rank; as, a man of good standing, or of high standing.
a.
Not transitory; not liable to fade or vanish; lasting; as, a standing color.
a.
Remaining erect; not cut down; as, standing corn.
a.
Moving with a quick, lively pace, or capable of so doing; dashing.
n.
A spinning wheel. See under Spinning.
a.
Established by law, custom, or the like; settled; continually existing; permanent; not temporary; as, a standing army; legislative bodies have standing rules of proceeding and standing committees.
p. pr. & vb. n.
of Scan
p. pr. & vb. n.
of Spawn
a.
Striking or overpowering with astonishment, especially on account of excellence; as, stunning poetry.
p. pr. & vb. n.
of Spin
n.
A spinning wheel.
a.
Not flowing; stagnant; as, standing water.