Documents
B-tree
Leaf node
in computer science a leaf node is a node computer science node of a tree data structure that has zero child node s...
Binary tree
in computer science a binary tree is a tree data structure tree data structure in which each node has at most two child n...
Flood fill
flood fill also called seed fill is an algorithm that determines the area glossary of graph the...
Binary search tree
in computer science a binary search tree bst is a binary tree which has the following properties each node has a value a...
Linked list
in computer science a linked list is one of the fundamental data structure s used in computer programming it consists of a...
Graph theory
in mathematics and computer science graph theory is the study of graph mathematics graphs mathematical structures used to model pairwis...
Extractor
this article is about the extractor in mathematics for other usage of this word see extractor firearms an n m d k epsilon...
Expander graph
...lar graph has good expansion with high probability ramanujan graph s are a family of d regular expander graphs with d being constant and with explicit constructions that have essentially the largest possible sp...
Disperser
an n m d k e disperser is a bipartite graph theory graph with n vertices on the left side each with degree...
Girth
a girth tack cycle contained in the graph if the graph doesn t contain any cycles its girth is define...
Grid network
a grid network is a kind of computer network consisting of a number of computer systems connected in a grid...
Heap (data structure)
Digraph
digraph has several meanings graph mathematics directed graph directed graph or digraph...
Chord
chord chord may mean chord geometry a line segment joining two points on a curve c...
