n
(computer science) A best-first graph search algorithm for finding a lowest-cost path to a goal.
n
(computing) A form of balanced tree used for storing and retrieving ordered data efficiently, a variation of the red-black tree.
n
(computing theory) An algorithm for pruning a search tree by eliminating any branch that is demonstrably inferior to a branch previously encountered.
n
(mathematics) A spiral that increases in distance from the point of origin at a constant rate.
n
(mathematics, computer science) The maximum number of child nodes that any node in a given tree (data structure) may have.
n
(computer science) A self-balancing binary search tree, where, for each node, the heights of the two child subtrees differ only by at most one.
n
(computing) An indexed data structure suitable for storage of a large number of items in a balanced fashion, with very few disk accesses required for locating the correct record block.
n
Abbreviation of Bailey-Borwein-Plouffe formula. [(mathematics) A formula for calculating pi, giving rise to a spigot algorithm for computing the nth base-16 digit without computing the preceding digits.]
n
(computer science) Synonym of Fenwick tree
n
(mathematics, computer science) A data structure in which each node has at most two children, each node but the root has one parent, and there are no cycles.
adj
(mathematics) Truncated using bitruncation.
n
(computing theory) A space-efficient probabilistic data structure that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not.
n
(mathematics) An unrooted binary tree that represents the hierarchical clustering of the edges of a undirected graph
n
(mathematics) The minimum width of a branch-decomposition
n
(computer graphics) An algorithm that identifies which points (pixels) should be set in order to draw a straight line between two points.
n
(computing theory) A generalization of the shortest path problem to graphs that are only partially observable (i.e. the graph is revealed while it is being explored).
n
Classification and regression tree
n
(graph theory) A subtree consisting of a node with exactly two leaves.
n
A subtree in a graph consisting of an internal node with exactly two leaves.
n
(graph theory) A closed path, without repeated vertices allowed.
n
A common recursive fast Fourier transform algorithm.
n
(mathematics) A tree that defines a cograph, its leaves corresponding to the nodes of the cograph.
n
(mathematics) The minimum, taken over all planar representations of a link or graph, of the number of times it crosses itself.
n
(graph theory) The set of edges that have one endpoint in each subset of the partition.
n
(computer science) A generalized algorithm for line clipping.
n
(graph theory) A kind of directed graph representing overlaps between sequences of symbols.
n
(graph theory) The number of edges that a vertex takes part in; a valency.
n
(programming) A data structure that represents a set of strings and allows for a query operation that tests whether a given string belongs to the set in time proportional to its length (thus more efficient in some situations than a trie).
n
(computer science) A data structure used to store such sets and perform operations on them efficiently.
n
(mathematics, astronomy) a drop in a graph between two linear portions (example)
n
(mathematics) A path comprising edges laid end to end.
n
A diagram for the purpose of top-down, deductive failure analysis, in which an undesired state of a system is studied using Boolean logic.
n
(computer science) A data structure that maintains prefix sums over a list of numbers while allowing dynamic updates and queries in logarithmic time.
n
(computing theory) A leaf in a finger tree data structure.
n
(computing theory) A purely functional tree-like data structure offering amortized constant time access to its "fingers" (leaves), used for the efficient implementation of other purely functional data structures.
n
(graph theory) A graph with no cycles; i.e., a graph made up of trees.
n
(mathematics) A constant approximately equal to 0.55721566, symbolized by γ (also known as the Euler–Mascheroni constant).
n
(databases) A type of search tree that features data and query extensibility.
n
(geometry) In a linear system of divisors on an n-dimensional variety, the number of free intersection points of n generic divisors.
n
(mathematics) A set of points constituting a graphical representation of a real function; (formally) a set of tuples (x_1,x_2,…,x_m,y)∈ R ᵐ⁺¹, where y=f(x_1,x_2,…,x_m) for a given function f: R ᵐ→ R . See also Graph of a function on Wikipedia.Wikipedia
n
(mathematics) A form of exchangeable graphon
n
(graph theory) A path through a graph which visits each vertex exactly once.
n
(information theory) Given two strings of equal length, the number of positions at which the corresponding symbols differ; it therefore indicates the minimum number of substitutions required to change one string into the other.
n
(computing theory) A tree (data structure) in which every non-leaf node is labelled with the hash of the labels of its children.
n
Alternative form of hash tree [(computing theory) A tree (data structure) in which every non-leaf node is labelled with the hash of the labels of its children.]
n
(computing) A data structure consisting of trees in which each node is greater than all its children.
n
(mathematics) A kind of collection of linked Petri nets.
n
(mathematics) An edge whose two nodes are in different networks
n
(mathematics) A mathematical operation that transforms a function for a discrete or continuous spectrum into a function for the amplitude with the given spectrum; an inverse transform of the Fourier transform.
n
(computer science, graph theory) A type of depth-first search in which each row of the tree is searched incrementally, simulating a breadth-first search with less memory usage.
n
(computing) A space-partitioning data structure for organizing points in a k-dimensional space, used in search algorithms etc.
n
(computing theory) A node, in a tree, that has no children.
adj
(mathematics, computing theory) In terms of the leaves of a tree or similar data structure.
n
A breadth-first search algorithm that finds optimal solutions for maze routing problems, used in the design of electronic components etc.
n
(computer science) Distance from the root node of a tree structure.
n
(computer science) A line clipping algorithm that uses the parametric equation of a line and inequalities describing the range of the clipping window to determine the intersections between the line and the clip window.
n
(computer science) A data structure that represents a forest (a set of rooted trees) and allows dynamic updates on the tree in logarithmic time.
n
(topology) A path that starts and ends at the same point.
n
(computer science, cryptography) A binary hash tree.
n
(graph theory) A directed graph that is permitted to have multiple arcs connecting the same source and target nodes.
n
(computing) A multi-element key into a data structure.
n
(computer science) A fast algorithm for line clipping that reduces the chances of clipping a single line segment multiple times.
n
(computing) The path length from a given node to its nearest descendant null node in a binary tree.
n
(data structures) One of several edges in a directed graph that has an endpoint in a specified vertex and for which the direction of the edge goes from the specified vertex to another vertex.
n
(graph theory) A sequence of vertices from one vertex to another using the arcs (edges). A path does not visit the same vertex more than once (unless it is a closed path, where only the first and the last vertex are the same).
n
Alternative spelling of path length [(graph theory) The number of edges traversed in a given path in a graph.]
n
(computing theory) A radix tree with radix of 2, meaning that each bit of the key is compared individually and each node is a two-way branch.
n
Alternative form of Patricia tree [(computing theory) A radix tree with radix of 2, meaning that each bit of the key is compared individually and each node is a two-way branch.]
n
(mathematics, sciences) A zero-dimensional mathematical object representing a location in one or more dimensions; something considered to have position but no magnitude or direction.
n
A postorder tree traversal.
n
(computing theory) Synonym of trie (“data structure”)
n
(mathematics) An apparent sequence used as a key in data compression
n
A treelike data structure each of whose nodes has up to four children, most often used to partition a two-dimensional space by recursively subdividing it.
n
(computing theory) A space-optimized trie data structure in which each node that is the only child is merged with its parent.
n
(computing) A type of self-balancing binary search tree, typically used to implement associative arrays.
n
(data mining) A data-analysis method that recursively partitions data into sets each of which are simply modeled using regression methods.
n
(computing theory) An algorithm that generates aesthetically pleasing drawings of binary trees (and by extension, n-ary trees).
n
(computing theory) A tree (data structure) set up to facilitate searching.
n
(computer science) A data structure that is used to store information about intervals (segments) and perform range queries, or queries on a set of intervals, in logarithmic time.
n
(graph theory) A destination vertex in a transportation network.
n
A discrete differentiation operator that computes an approximation of the gradient of the image intensity function, used in image processing and computer vision, particular for detecting edges.
n
(computer science) A data structure that can answer range maximum or range minimum queries on an immutable list of values in constant time, and other range queries in logarithmic time.
n
(computing theory) A self-balancing binary search tree with the additional property that recently accessed elements are quick to access again.
n
(computing) A method of preventing routing loops in distance-vector routing protocols by prohibiting a router from advertising a route back onto the interface from which it was learned.
n
(mathematics) A partial bag (collection of objects with possible duplicates).
n
(mathematics) A subset of a circuit
n
(graph theory) A graph or network that makes up part of a larger graph or network.
n
(mathematics) A subset of an itemset
n
(mathematics) The mass of a substring of a weighted alphabet
n
(mathematics) A matrix formed by selecting certain rows and columns from a larger matrix.
n
(mathematics, computer science, graph theory) A tree wholly contained in another.
n
(computing) (of a string) a radix tree containing all suffixes of the string
n
(mathematics) Supremum, upper limit.
n
(computing theory) A tree that contains another tree.
n
(mathematics) A form of graph used to describe data structures
n
(computer science) A type of randomized binary search tree where nodes are labelled with randomly chosen priority values and which is simultaneously a heap on those priorities
n
(computing theory) A recursive data structure in which each node has zero or more nodes as children.
adj
(mathematics) That can be represented as a tree (graph)
n
(mathematics) A measure of the size or complexity of a tree.
n
(computing theory) A list of trees (the data structure).
n
A representation of hierarchical data as a set of nested rectangles
n
(mathematics) A graphical representation of a tree (data structure)
n
(mathematics) A space whose components are trees.
n
(mathematics, computing) The width (maximum number of nodes or leaves at any level) of a tree.
n
(computer science) An ordered tree data structure that is used to store an associative array where the keys are usually strings.
n
(mathematics) A unique tree (for a set of vertices)
n
(computer science) A tree data structure that implements an associative array with keys of up to m bits. It can perform all operations in a time proportional to the log of the size of its largest element, or equivalently with an upper bound equal to the logarithm of 2 multiplied by m.
n
(graph theory) A theorem stating that the set of edges of a finite graph can be written as a union of disjoint simple cycles if and only if every vertex has even degree.
n
(computing) An efficient hardware implementation of a digital circuit that multiplies two integers.
n
(computer graphics) An algorithm that solves the problem of rendering a complicated image by recursive subdivision of a scene until areas are obtained that are trivial to compute.
n
(mathematics) A root; a zero; a point at which a line crosses the x-axis of a Cartesian grid, where y is 0.
Note: Concept clusters like the one above are an experimental OneLook
feature. We've grouped words and phrases into thousands of clusters
based on a statistical analysis of how they are used in writing. Some
of the words and concepts may be vulgar or offensive. The names of the
clusters were written automatically and may not precisely describe
every word within the cluster; furthermore, the clusters may be
missing some entries that you'd normally associate with their
names. Click on a word to look it up on OneLook.
Our daily word games Threepeat and Compound Your Joy are going strong. Bookmark and enjoy!
Today's secret word is 8 letters and means "Believable and worthy of trust." Can you find it?