breadth first traversal
1Tree traversal — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional …
2Depth-first search — Order in which the nodes are visited Class Search algorithm Data structure Graph Worst case performance …
3Iterative deepening depth-first search — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional …
4Radix sort — In computer science, radix sort is a sorting algorithm that sorts integers by processing individual digits. Because integers can represent strings of characters (e.g., names or dates) and specially formatted floating point numbers, radix sort is… …
5Corecursion — In computer science, corecursion is a type of operation that is dual to recursion. Corecursion and codata allow total languages to work with infinite data structures such as streams. Corecursion is often used in conjunction with lazy evaluation.… …
6Apriori algorithm — In computer science and data mining, Apriori is a classic algorithm for learning association rules. Apriori is designed to operate on databases containing transactions (for example, collections of items bought by customers, or details of a… …
7Wget — Developer(s) Giuseppe Scrivano, Hrvoje Nikšić Initial release January 1996; 15 years ago (1996 January) Stable release 1.13.4 / 17 September 2011; 2 months ago ( …
8Chemical database — A chemical database is a database specifically designed to store chemical information. This information is about chemical and crystal structures, spectra, reactions and syntheses, and thermophysical data. Contents 1 Types of chemical databases… …
9Cuthill–McKee algorithm — In the mathematical subfield of matrix theory, the Cuthill–McKee algorithm (named for Elizabeth Cuthill and J. McKee) is an algorithm to reduce the bandwidth of sparse symmetric matrices. The reverse Cuthill–McKee algorithm (RCM) is the same… …
10d-ary heap — The d ary heap or d heap is a priority queue data structure, a generalization of the binary heap in which the nodes have d children instead of 2.[1][2][3] Thus, a binary heap is a 2 heap. According to Tarjan[2] and Jensen et al …
