AI & ChatGPT searches , social queriess for RECURSIVE TREE
Search references for RECURSIVE TREE. Phrases containing RECURSIVE TREE
See searches and references containing RECURSIVE TREE!
Search references for RECURSIVE TREE. Phrases containing RECURSIVE TREE
See searches and references containing RECURSIVE TREE!RECURSIVE TREE
Tree graph with nodes numbered in order of distance from the root
In graph theory, a recursive tree (i.e., unordered tree) is a labeled, rooted tree. A size-n recursive tree's vertices are labeled by distinct positive
Recursive_tree
random recursive tree is a rooted tree chosen uniformly at random from the recursive trees with a given number of vertices. In a recursive tree with n
Random_recursive_tree
Rooted binary tree data structure
binary search tree for a specific key can be programmed recursively or iteratively. Searching begins by examining the root node. If the tree is nil, the
Binary_search_tree
Use of functions that call themselves
provide a stopping criterion (e.g., using a depth counter in recursive tree traversal). In recursive computer programming, omitting the base case or defining
Recursion_(computer_science)
Limited form of tree data structure
a k-ary tree where k = 2. A recursive definition using set theory is that a binary tree is a triple (L, S, R), where L and R are binary trees or the empty
Binary_tree
Class of algorithms
expression tree. Recursively traverse the current node's left subtree. Visit the current node (in the figure: position green). Recursively traverse the
Tree_traversal
Undirected, connected, and acyclic graph
labeled tree on n vertices (for nonnegative integers n) are typically given the labels 1, 2, …, n. A recursive tree is a labeled rooted tree where the
Tree_(graph_theory)
Decision support tool
A decision tree is a decision support recursive partitioning structure that uses a tree-like model of decisions and their possible consequences, including
Decision_tree
Well-quasi-ordering of finite trees
TREE ( n ) {\displaystyle {\text{TREE}}(n)} is finite for all n {\displaystyle n} . The TREE function eventually dominates every provably recursive function
Kruskal's_tree_theorem
Data structure in tree form sorted for fast lookup
binary search trees, but the same idea can be applied to trees of other formats. search-recursive(key, node) if node is NULL return EMPTY_TREE if key < node
Search_tree
Self-balancing binary search tree data structure
disturbs the recursive algorithms and proofs. As an example, every perfect binary tree that consists only of black nodes is a red–black tree. The read-only
Red–black_tree
Area of discrete mathematics
weights and using the minimum spanning tree for those weights. Random recursive tree, increasingly labelled trees, which can be generated using a simple
Graph_theory
Tool for analyzing divide-and-conquer algorithms
solution tree has a node for each recursive call, with the children of that node being the other calls made from that call. The leaves of the tree are the
Master theorem (analysis of algorithms)
Master_theorem_(analysis_of_algorithms)
Index of articles associated with the same name
insertion orders, and trees that are uniformly distributed with a given number of nodes Random recursive tree, increasingly labelled trees, which can be generated
Random_tree
Data type that refers to itself in its definition
computer science is in defining dynamic data structures such as Lists and Trees. Recursive data structures can dynamically grow to an arbitrarily large size in
Recursive_data_type
Computer data structure
recursively applying this procedure to partition the data into smaller and smaller sets, a tree data structure is created where neighbors in the tree
Vantage-point_tree
Data structures used in spatial indexing
better performance for common map applications. Bulk loaded R* tree using Sort-Tile-Recursive (STR). The leaf pages do not overlap at all, and the directory
R-tree
Music that is ever-different and changing, and that is created by a system
music (Lerdahl and Jackendoff 1983), which generate material with a recursive tree structure. Music generated by a system component that has no discernible
Generative_music
Machine learning algorithm
"An Introduction to Recursive Partitioning: Rationale, Application and Characteristics of Classification and Regression Trees, Bagging and Random Forests"
Decision_tree_learning
Multidimensional search tree for points in k dimensional space
degradation of a k-d tree search in the worst case, a maximum distance parameter can be provided to the tree search algorithm, and the recursive search can be
K-d_tree
such as river networks, file system trees, or threaded comments. They are special cases of more general recursive fixpoint queries, which compute transitive
Hierarchical and recursive queries in SQL
Hierarchical_and_recursive_queries_in_SQL
Type of neural network which utilizes recursion
A recursive neural network is a kind of deep neural network created by applying the same set of weights recursively over a structured input, to produce
Recursive_neural_network
Recursive partitioning is a statistical method for multivariable analysis. Recursive partitioning creates a decision tree that strives to correctly classify
Recursive_partitioning
Data structure in computer science
Octrees are most often used to partition a three-dimensional space by recursively subdividing it into eight octants. Octrees are the three-dimensional
Octree
Two functions defined from each other
defined by mutual recursion is a tree, which can be defined mutually recursively in terms of a forest (a list of trees). Symbolically: f: [t[1], ..., t[k]]
Mutual_recursion
Data structure
can be defined recursively or iteratively much as lookups are defined. This recursive method is continually called on nodes of the tree given a key which
Ternary_search_tree
Utility software
exported functions of a portable executable file. It also displays a recursive tree of all the dependencies of the executable file (all the files it requires
Dependency_Walker
Tree-based computer data structure
balanced with a recursive algorithm In addition, a B-tree minimizes waste by making sure the interior nodes are at least half full. A B-tree can handle an
B-tree
Method for recursively subdividing a space into two subsets using hyperplanes
binary space partitioning (BSP) is a method for space partitioning which recursively subdivides a Euclidean space into two convex sets by using hyperplanes
Binary_space_partitioning
explicitly but implicitly by some recursive splitting-function defined on the hyperrectangles belonging to the tree's nodes. Each inner node's split plane
Implicit_k-d_tree
Self-balancing binary search tree
is inserted as the root of the tree. If the tree is not empty, then we go down the root, and recursively go down the tree searching for the location to
AVL_tree
Data type defined by combining other types
datatype is recursive, the entire sum of products is wrapped in a recursive type, and each constructor also rolls the datatype into the recursive type. For
Algebraic_data_type
Form of balanced tree
begins with the normal binary tree search and insertion procedure. Then, as the call stack unwinds (assuming a recursive implementation of the search)
AA_tree
Rooted tree Ordered tree Recursive tree SPQR tree Suffix tree Technology tree Trie Patricia trie Spanning tree Minimum spanning tree Boruvka's algorithm Kruskal's
List_of_graph_theory_topics
Linked node hierarchical data structure
science, a tree is a widely used abstract data type that represents a hierarchical tree structure with a set of connected nodes. Each node in the tree can be
Tree_(abstract_data_type)
Mathematical function
1089/cmb.2005.12.1004. PMID 16201918. Janson, Svante (2008). "Plane recursive trees, Stirling permutations and an urn model". Fifth Colloquium on Mathematics
Double_factorial
Least-weight tree connecting graph vertices
contain the minimum spanning tree, and smaller by a constant factor than the starting graph. Apply the optimal algorithm recursively to this graph. The runtime
Minimum_spanning_tree
Tree data structure that partitions a 2D area
octrees and are most often used to partition a two-dimensional space by recursively subdividing it into four quadrants or regions. The data associated with
Quadtree
System to identify resources on a network
methods, such as recursive, non-recursive, and iterative. A resolution process may use a combination of these methods. In a non-recursive query, a DNS resolver
Domain_Name_System
Hypothetical event
even more capable machine, which could repeat the process in turn. This recursive self-improvement could accelerate, potentially allowing enormous qualitative
Technological_singularity
Algorithm to search the nodes of a graph
edges. The recursive implementation will visit the nodes from the example graph in the following order: A, B, D, F, E, C, G. The non-recursive implementation
Depth-first_search
Data structure
root of a B+ Tree represents the whole range of values in the tree, where every internal node represents a subinterval. For this recursive interval information
B+_tree
Quickly growing function
examples of a total computable function that is not primitive recursive. All primitive recursive functions are total and computable, but the Ackermann function
Ackermann_function
Binary tree derived from a sequence of numbers
construct the Cartesian tree for a given sequence of distinct numbers, set its root to be the minimum number in the sequence, and recursively construct its left
Cartesian_tree
Family of higher-order functions
function that analyzes a recursive data structure and, through use of a given combining operation, recombines the results of recursively processing its constituent
Fold_(higher-order_function)
Proof method in mathematical logic
proposition P(x) holds for all x of some sort of recursively defined structure, such as formulas, lists, or trees. A well-founded partial order is defined on
Structural_induction
Tree data structure with a variable and unbounded number of branches per node
upside-down on the Northern hemisphere. Well-founded rose trees can be defined by a recursive construction of entities of the following types: A base entity
Rose_tree
Binary tree selected at random
random tree models the subtree of correct recursive calls. The algorithm succeeds on a graph of n {\displaystyle n} vertices whenever this random tree of
Random_binary_tree
science, a K-D-B-tree (k-dimensional B-tree) is a tree data structure for subdividing a k-dimensional search space. The aim of the K-D-B-tree is to provide
K-D-B-tree
Automated method for solving mazes
but nothing more. [1] If given an omniscient view of the maze, a simple recursive algorithm can tell one how to get to the end. The algorithm will be given
Maze-solving_algorithm
Infinitely detailed mathematical structure
using recursive algorithms and L-systems techniques. The recursive nature of some patterns is obvious in certain examples—a branch from a tree or a frond
Fractal
Tree data structure
empty vEB tree takes O(1) time. So, even though the algorithm sometimes makes two recursive calls, this only occurs when the first recursive call was into
Van_Emde_Boas_tree
Space partitioning data structure
k-d trees. This is an offline algorithm, that is, an algorithm that operates on the entire data set at once. The tree is built top-down by recursively splitting
Ball_tree
Data compression technique
bottom-up). These procedures start at the last node in the tree (the lowest point). Following recursively upwards, they determine the relevance of each individual
Decision_tree_pruning
Computer science data structure
insert X in that child, recursively. If X intersects the interval of the right child of T, then insert X in that child, recursively. The complete construction
Segment_tree
Shell command in various operating systems
In computing, tree is a recursive directory listing command or program that produces a depth-indented listing of files. Originating in PC- and MS-DOS
Tree_(command)
Succinct data structure
suffix arrays, it has found application in several contexts. The tree is defined by recursively partitioning the alphabet into pairs of subsets; the leaves
Wavelet_Tree
Tree data structure to hold intervals
{\displaystyle x} . The tree is walked with a similar recursive algorithm as would be used to traverse a traditional binary tree, but with extra logic to
Interval_tree
Heuristic search algorithm for evaluating game trees
in a Go-playing program. In 2002, Chang et al. proposed the idea of "recursive rolling out and backtracking" with "adaptive" sampling choices in their
Monte_Carlo_tree_search
Computer science and linguistics concept relating to non-terminal production
science, a grammar is informally called a recursive grammar if it contains production rules that are recursive, meaning that expanding a non-terminal according
Recursive_grammar
A recursive transition network ("RTN") is a graph theoretical schematic used to represent the rules of a context-free grammar. RTNs have application to
Recursive_transition_network
Search tree data structure
trie (/ˈtraɪ/, /ˈtriː/ ), also known as a digital tree or prefix tree, is a specialized search tree data structure used to store and retrieve strings
Trie
Divide and conquer sorting algorithm
sequentially into an explicit tree, quicksort organizes them concurrently into a tree that is implied by the recursive calls. The algorithms make exactly
Quicksort
Combinatorial game theory concept to represent all possible game states
induction or retrograde analysis) can be described recursively as follows. Color the final ply of the game tree so that all wins for player 1 are colored one
Game_tree
Type of grammar for describing formal languages
in practice, e.g. by a recursive descent parser. Unlike CFGs, PEGs cannot be ambiguous; a string has exactly one valid parse tree or none. It is conjectured
Parsing_expression_grammar
Graphics structure
bounding volumes in a recursive fashion, eventually resulting in a tree structure with a single bounding volume at the top of the tree. Bounding volume hierarchies
Bounding_volume_hierarchy
Visualisation method for hierchical data
widths). The main distinguishing feature of a treemap, however, is the recursive construction that allows it to be extended to hierarchical data with any
Treemapping
Binary tree variant
tree is traversal: visiting all the items in order of the key. A simple recursive traversal algorithm that visits each node of a binary search tree is
Threaded_binary_tree
Right-angled fractal canopy
levels of the recursive construction. The H tree is a self-similar fractal; its Hausdorff dimension is equal to 2. The points of the H tree come arbitrarily
H_tree
Algorithms which recursively solve subproblems
conquer is an algorithm design paradigm. A divide-and-conquer algorithm recursively breaks down a problem into two or more sub-problems of the same or related
Divide-and-conquer_algorithm
Parsing technique
Simple implementations of top-down parsing do not terminate for left-recursive grammars, and top-down parsing with backtracking may have exponential
Top-down_parsing
Tree data structure
and recursively traverses all the paths which cannot be excluded from leading to qualifying objects. Algorithm RangeSearch Input: Node N of M-Tree MT,
M-tree
Hydra game in mathematical logic
tree. The hydra game can be used to generate a rapidly growing function, B H ( n ) {\displaystyle BH(n)} , which eventually dominates all recursive functions
Buchholz_hydra
Software programming optimization technique
(and for purposes other than speed gains), such as in simple mutually recursive descent parsing. In the context of some logic programming languages, memoization
Memoization
Automated methods for the creation of mazes
and one for the exit, are removed. This algorithm, also known as the "recursive backtracker" algorithm, is a randomized version of the depth-first search
Maze_generation_algorithm
Priority queue implemented with a variant of a binary heap
merge is done recursively by merging B with A's right subtree. This might change the S-value of A's right subtree. To maintain the leftist tree property,
Leftist_tree
Functional programming construct
red–black tree and a function to re-balance it after element insertion shows how to match on a more complex structure generated by a recursive data type
Pattern_matching
Random search tree data structure
of descendants, and the join proceeds recursively. The information stored per node in the randomized binary tree is simpler than in a treap (a small integer
Treap
Formal grammar
can be seen as a special kind of regular tree grammar, describing a set of single-path trees. A regular tree grammar G is defined by the tuple G = (N
Regular_tree_grammar
Machine learning algorithm
computations to find a solution compared to Shafer-Shenoy. Computed recursively Multiple recursions of the Shafer-Shenoy algorithm results in Hugin algorithm
Junction_tree_algorithm
Tree-based machine learning method for classification
decision trees and boosted decision stumps. Typically, equivalent accuracy can be achieved with a much simpler tree structure than recursive partitioning
Alternating_decision_tree
Algorithm to search the nodes of a graph
explored 12 w.parent := v 13 Q.enqueue(w) This non-recursive implementation is similar to the non-recursive implementation of depth-first search, but differs
Breadth-first_search
computation tree is well-founded if and only if the computation performed by it is total recursive. Each state x {\displaystyle x} in a computation tree may be
Kleene–Brouwer_order
Data structure
the original tree T( i.e. in O ( log n ) {\displaystyle {\mathcal {O}}(\log n)} time); the top tree essentially represents the recursive subdivision
Top_tree
Problem optimization method
break apart recursively. Likewise, in computer science, if a problem can be solved optimally by breaking it into sub-problems and then recursively finding
Dynamic_programming
Purely functional data structure
a finger tree is a purely functional data structure that can be used to efficiently implement other functional data structures. A finger tree gives amortized
Finger_tree
Self-balancing binary search tree
weight-balanced trees t1 and t2 representing sets A and B, is a weight-balanced tree t that represents A ∪ B. The following recursive function computes
Weight-balanced_tree
Ordered tree data structure
of the tree; each internal node stores the largest value of its left subtree. A range tree on a set of points in d-dimensions is a recursively defined
Range_tree
Higher-order function Y for which Y f = f (Y f)
in functional programming languages, and provide a means to allow for recursive definitions. In the classical untyped lambda calculus, every function
Fixed-point_combinator
all entries in a tree satisfying a predicate p {\displaystyle p} , and return a tree containing all selected entries. It recursively filters the two subtrees
Join-based_tree_algorithms
Sequence of characters, data type
finite length) can be viewed as nodes on a perfect k {\displaystyle k} -ary tree. Infinite strings (otherwise not considered here) can be viewed as infinite
String_(computer_science)
Algorithm that estimates unknowns from a series of measurements over time
more weight given to estimates with greater certainty. The algorithm is recursive. It can operate in real time, using only the present input measurements
Kalman_filter
different from the splitter. An exponential tree with n {\displaystyle n} values is defined recursively: The root has Θ ( n 1 / k ) {\displaystyle \Theta
Exponential_tree
Topics referred to by the same term
(automata theory) Tree (command), a recursive directory listing program that produces a depth indented listing of files Tree (abstract data type), a widely
Tree_(disambiguation)
Ordinals in mathematics and set theory
uncountable ordinal, ω1), described below. Ordinal numbers below ωCK 1 are the recursive ordinals (see below). Countable ordinals larger than this may still be
Large_countable_ordinal
Type of parser in computer science
recursive parsers are a derivation from the more common recursive descent parsers. Tail recursive parsers are commonly used to parse left recursive grammars
Tail_recursive_parser
Plane fractal constructed from squares
of the squares coincide pairwise. The same procedure is then applied recursively to the two smaller squares, ad infinitum. The illustration below shows
Pythagoras_tree_(fractal)
English Christmas carol from late 18th century
pounding on the keys of an old typewriter at random", takes advantage of the recursive structure of the song to print its lyrics with code that is shorter than
The Twelve Days of Christmas (song)
The_Twelve_Days_of_Christmas_(song)
Data structure for representing a forest
child of v recursively until we can go no further, and this node is the root R. The root may be linearly deep (which is worst case for a splay tree), we therefore
Link/cut_tree
General purpose functional programming language
is a recursive abstract type that defines a binary tree with some basic operations: #absrectype (*, **) tree = * + ** # (*, **) tree # (*, **) tree # with
ML_(programming_language)
RECURSIVE TREE
RECURSIVE TREE
Surname or Lastname
German
German : habitational name from any of several places called Langen or Langenau in Germany, Bohemia, and Silesia.English : habitational name from any of four places in Shropshire and Staffordshire called Longner or Longnor. Longner and Longnor in Shropshire are from Old English lang ‘long’ + alor ‘alder tree’, ‘alder copse’, as is Longnor near Penkridge, Staffordshire. But Longnor, Staffordshire is from Old English lang (genitive langan) + ofer ‘ridge’.
Surname or Lastname
Americanized spelling of Swedish Ap(p)elberg, an ornamental name composed of the elements apel ‘apple tree’ + berg ‘mountain’.English
Americanized spelling of Swedish Ap(p)elberg, an ornamental name composed of the elements apel ‘apple tree’ + berg ‘mountain’.English : the surname Applebury is recorded in England in the 19th century, perhaps a habitational name from a lost place.
Surname or Lastname
German
German : from Middle High German lins(e) ‘lentil’, presumably a metonymic occupational nickname for a grower of lentils.German : from a short form of a Germanic personal name formed with Old High German lint ‘snake’ or linta ‘linden tree’, ‘shield’.English (Staffordshire) : unexplained. Possibly a variant of Lynes.Latvian : possibly from lins ‘flax’.
Surname or Lastname
English (mainly southeastern)
English (mainly southeastern) : topographic name for someone who lived near a conspicuous tree, Middle English tre(w).
Surname or Lastname
English
English : habitational name from either of two places in West Yorkshire called Lindley, or from Linley in Shropshire and Wiltshire, all named from Old English līn ‘flax’ + lēah ‘wood’, ‘glade’, with epenthetic -d-, or from another Lindley in West Yorkshire (near Otley), named in Old English as ‘lime wood’, from lind ‘lime tree’ + lēah ‘woodland clearing’. Lindley in Leicestershire probably also has this origin, and is a further possible source of the surname.German : habitational name from places in Bavaria and Hannover called Lindloh, meaning ‘lime grove’, or a topographic name with the same meaning (see Linde + Loh).
Surname or Lastname
English
English : variant of Treece.
Surname or Lastname
English
English : from the Middle English and Old French personal name Lorens, Laurence (Latin Laurentius ‘man from Laurentum’, a place in Italy probably named from its laurels or bay trees). The name was borne by a saint who was martyred at Rome in the 3rd century ad; he enjoyed a considerable cult throughout Europe, with consequent popularity of the personal name (French Laurent, Italian, Spanish Lorenzo, Catalan Llorenç, Portuguese Lourenço, German Laurenz; Polish Wawrzyniec (assimilated to the Polish word wawrzyn ‘laurel’), etc.). The surname is also borne by Jews among whom it is presumably an Americanized form of one or more like-sounding Ashkenazic surnames.
Surname or Lastname
Cornish
Cornish : habitational name from places so named in the parishes of Zennor and St. Levan, both of which appear earlier in the form Trethyn, from Cornish tre ‘homestead’, ‘settlement’ + dyn ‘fort’.English : variant of Treece, from a form with the weak plural ending.
Surname or Lastname
English
English : topographic name from the plural of Middle English tre(w) ‘tree’.
Surname or Lastname
Swedish
Swedish : ornamental name composed of the elements lind ‘lime tree’ + -ell, a common suffix of Swedish surnames, from the Latin adjectival suffix -elius.English : habitational name from Lindal, Cumbria (formerly in Lancashire) or Lindale, also in Cumbria; both are named from Old Norse lind ‘lime tree’ + dalr ‘valley’.
Surname or Lastname
English
English : habitational name from places in Devon, Oxfordshire, and Lancashire called Langtree, from Old English lang, long ‘long’, ‘tall’ + trēow ‘tree’.
Surname or Lastname
English
English : topographic name for someone who lived by a maple tree, Middle English mapel (Old English mapul).French : from Latin mapula, a diminutive of mappa ‘piece of cloth’, ‘napkin’, presumably a metonymic occupational name for a cloth merchant or a weaver.
Surname or Lastname
English
English : habitational name possibly from any of three places in Devon called Lincombe, named in Old English with līn ‘flax’ or lind ‘lime tree’ + cumb ‘valley’.
Surname or Lastname
Southern French
Southern French : topographic name for someone who lived by an
oak tree or oak grove, from Occitan garric (masculine) ‘kermes
oak’ or garrique (feminine) ‘grove of kermes oaks’.English (Norfolk) : variant of Geary 2.A bearer with the secondary surname
Surname or Lastname
English
English : variant of Treece.
Surname or Lastname
English
English : from a pet form of Jessup.German : probably a topographic name from Czech jes(en) ‘ash tree’.
Surname or Lastname
North German
North German : from a short form of the personal name Jesper, a Low German form of Kaspar.South German : from a reduced form of the personal name Johannes (see John).Eastern German (of Slavic origin) : topographic name from Czech jes(en) ‘ash tree’.English : from a short form of Jessup.French : from Old French jaisse ‘chick pea’; probably a metonymic occupational name for a grower of chick peas or a topographic name.
Surname or Lastname
Dutch, German, and Jewish (Ashkenazic)
Dutch, German, and Jewish (Ashkenazic) : variant (plural) of Linde.English : variant spelling of Lindon.Belgian and Dutch (van Linden) : habitational name from places called Linden in Brabant and North Brabant.Dutch (van der Linden) : habitational name from any of numerous places called Ter Linde.Irish : reduced form of McLinden.Swedish (Lindén) : ornamental name from lind ‘lime tree’ + the common suffix -én, from the Latin adjectival ending -enius.
Surname or Lastname
English
English : habitational name from places called Lindon in Lincolnshire, Linden End, Haddenham, in Cambridgeshire, or Lyndon, Rutland, all named from Old English lind ‘lime tree’ or līn ‘flax’ + dūn ‘hill’.
Surname or Lastname
Swedish
Swedish : ornamental name from lind ‘lime tree’ + either the German suffix -er denoting an inhabitant, or the surname suffix -ér, derived from the Latin adjectival ending -er(i)us.English (mainly southeastern) : variant of Lind 2.German : habitational name from any of numerous places called Linden or Lindern, named with German Linden ‘lime trees’.
RECURSIVE TREE
RECURSIVE TREE
Girl/Female
Arabic, Muslim
Full; Complete
Boy/Male
Hindu, Indian
Meek; Humble; Poor
Girl/Female
Indian
The jujube fruit
Girl/Female
German, Scandinavian
Womanly; Strength; Female Version of Karl; Tiny and Womanly
Boy/Male
Hindu
Always speaking lie, Someone who gets victory with truth, Truthful
Boy/Male
Tamil
Strong
Girl/Female
Indian
Gladdened
Boy/Male
Hindu
Fortunate
Boy/Male
Tamil
Anirvan | அநிரà¯à®µà®¾à®£Â
Undying
Boy/Male
Indian, Punjabi, Sikh
Love for God
RECURSIVE TREE
RECURSIVE TREE
RECURSIVE TREE
RECURSIVE TREE
RECURSIVE TREE
a.
Going back; receding.
a.
Flowing; easy; cursive; as, a running hand.
n.
The act of recurring; return.
a.
Cold; forbidding; offensive; as, repulsive manners.
n.
A revulsive medicine.
n.
That which causes revulsion; specifically (Med.), a revulsive remedy or agent.
a.
Serving, or able, to repulse; repellent; as, a repulsive force.
a.
Repulsive; driving back.
v. t.
Causing revulsion; revulsive.
a.
Not amiable; morose; ill-natured; repulsive.
a.
Causing, or tending to, revulsion.
a.
Affording retirement from society.
a.
Making an incursion; invasive; aggressive; hostile.
a.
Preceding; introductory; precursory.
a.
Prone to make excursions; wandering; roving; exploring; as, an excursive fancy.
adv.
In a decursive manner.
a.
Manifesting distaste or dislike; repulsive.
a.
Repulsive by itself; as, the idiorepulsive power of heat.
n.
A character used in cursive writing.
a.
Running down; decurrent.