README
¶
goalgorithms
Algorithms + Data Structures = Programs
Directories
¶
| Path | Synopsis |
|---|---|
|
algorithms
|
|
|
datastructures
|
|
|
avltree
Package avltree implements a avl tree: In computer science, an **AVL tree** (named after inventors Adelson-Velsky and Landis) is a self-balancing binary search tree.
|
Package avltree implements a avl tree: In computer science, an **AVL tree** (named after inventors Adelson-Velsky and Landis) is a self-balancing binary search tree. |
|
binarysearchtree
Package binarysearchtree implements a binary search tree: In computer science, **binary search trees** (BST), sometimes called ordered or sorted binary trees, are a particular type of container: data structures that store "items" (such as numbers, names etc.) in memory.
|
Package binarysearchtree implements a binary search tree: In computer science, **binary search trees** (BST), sometimes called ordered or sorted binary trees, are a particular type of container: data structures that store "items" (such as numbers, names etc.) in memory. |
|
bitmap
Package bitmap implements a bit map: In computing, a bitmap is a mapping from some domain (for example, a range of integers) to bits.
|
Package bitmap implements a bit map: In computing, a bitmap is a mapping from some domain (for example, a range of integers) to bits. |
|
bloomfilter
Package bloomfilter implements a bloom filter: A **bloom filter** is a space-efficient probabilistic data structure designed to test whether an element is present in a set.
|
Package bloomfilter implements a bloom filter: A **bloom filter** is a space-efficient probabilistic data structure designed to test whether an element is present in a set. |
|
disjointset
Package disjointset implements a doubly disjoint set: **Disjoint-set** data structure (also called a union–find data structure or merge–find set) is a data structure that tracks a set of elements partitioned into a number of disjoint (non-overlapping) subsets.
|
Package disjointset implements a doubly disjoint set: **Disjoint-set** data structure (also called a union–find data structure or merge–find set) is a data structure that tracks a set of elements partitioned into a number of disjoint (non-overlapping) subsets. |
|
doublylinkedlist
Package doublylinkedlist implements a doubly linked list: * this package is just copied from container/list in standard library.
|
Package doublylinkedlist implements a doubly linked list: * this package is just copied from container/list in standard library. |
|
fenwicktree
Package fenwicktree implements a binary indexed tree: A **Fenwick tree** or **binary indexed tree** is a data structure that can efficiently update elements and calculate prefix sums in a table of numbers.
|
Package fenwicktree implements a binary indexed tree: A **Fenwick tree** or **binary indexed tree** is a data structure that can efficiently update elements and calculate prefix sums in a table of numbers. |
|
hashset
Package hashset implement a set datasruct: In computer science, a set is an abstract data type that can store unique values, without any particular order.
|
Package hashset implement a set datasruct: In computer science, a set is an abstract data type that can store unique values, without any particular order. |
|
heap
Package heap implement a binary heap datasruct: In computer science, a heap is a specialized tree-based data structure which is essentially an almost completetree that satisfies the heap property: * In a max heap, for any given node C, if P is a parent node of C, then the key * of P is greater than or equal to the key of C. * In a min heap, the key of P is less than or equal to the key of C. The node * at the "top" of the heap (with no parents) is called the root node.
|
Package heap implement a binary heap datasruct: In computer science, a heap is a specialized tree-based data structure which is essentially an almost completetree that satisfies the heap property: * In a max heap, for any given node C, if P is a parent node of C, then the key * of P is greater than or equal to the key of C. * In a min heap, the key of P is less than or equal to the key of C. The node * at the "top" of the heap (with no parents) is called the root node. |
|
linkedlist
Package linkedlist implements a doubly linked list: In computer science, a **linked list** is a linear collection of data elements, in which linear order is not given by their physical placement in memory.
|
Package linkedlist implements a doubly linked list: In computer science, a **linked list** is a linear collection of data elements, in which linear order is not given by their physical placement in memory. |
|
priorityqueue
Package priorityqueue implement a priority queue heap datasruct: In computer science, a **priority queue** is an abstract data type which is like a regular queue or stack data structure, but where additionally each element has a "priority" associated with it.
|
Package priorityqueue implement a priority queue heap datasruct: In computer science, a **priority queue** is an abstract data type which is like a regular queue or stack data structure, but where additionally each element has a "priority" associated with it. |
|
queue
Package queue implement a queue datasruct: In computer science, a **queue** is a particular kind of abstract data type or collection in which the entities in the collection are kept in order and the principle (or only) operations on the collection are the addition of entities to the rear terminal position, known as enqueue, and removal of entities from the front terminal position, known as dequeue.
|
Package queue implement a queue datasruct: In computer science, a **queue** is a particular kind of abstract data type or collection in which the entities in the collection are kept in order and the principle (or only) operations on the collection are the addition of entities to the rear terminal position, known as enqueue, and removal of entities from the front terminal position, known as dequeue. |
|
redblacktree
Package redblacktree implements a red-black tree: A **red–black tree** is a kind of self-balancing binary search tree in computer science.
|
Package redblacktree implements a red-black tree: A **red–black tree** is a kind of self-balancing binary search tree in computer science. |
|
segmenttree
Package segmenttree implements a segment tree: In computer science, a **segment tree** also known as a statistic tree is a tree data structure used for storing information about intervals, or segments.
|
Package segmenttree implements a segment tree: In computer science, a **segment tree** also known as a statistic tree is a tree data structure used for storing information about intervals, or segments. |
|
stack
Package stack implement a stack datasruct: In computer science, a stack is an abstract data type that serves as a collection of elements, with two main principal operations: * push: which adds an element to the collection.
|
Package stack implement a stack datasruct: In computer science, a stack is an abstract data type that serves as a collection of elements, with two main principal operations: * push: which adds an element to the collection. |
|
trie
Package trie implement a trie datasruct: In computer science, a **trie**, also called digital tree and sometimes radix tree or prefix tree (as they can be searched by prefixes), is a kind of search tree—an ordered tree data structure that is used to store a dynamic set or associative array where the keys are usually strings.
|
Package trie implement a trie datasruct: In computer science, a **trie**, also called digital tree and sometimes radix tree or prefix tree (as they can be searched by prefixes), is a kind of search tree—an ordered tree data structure that is used to store a dynamic set or associative array where the keys are usually strings. |
|
playground
|
|
|
fun
command
|
Click to show internal directories.
Click to hide internal directories.