Difference between revisions of "Template:Data structures"
Jump to navigation
Jump to search
(reorganized) |
|||
| Line 6: | Line 6: | ||
|list1 = [[Collection (computing)|Collection]]{{·}} [[Container (data structure)|Container]] | |list1 = [[Collection (computing)|Collection]]{{·}} [[Container (data structure)|Container]] | ||
| − | |group2 = [[ | + | |group2 = [[Abstract data type|Abstract]] |
| − | |list2 = [[ | + | |list2 = [[List (computing)|List]]{{·}} [[Associative array]]{{·}} [[Multimap]]{{·}} [[Set (computer science)|Set]]{{·}} [[Set (computer science)#Multiset|Multiset]]{{·}} [[Double-ended queue]]{{·}} [[Queue (data structure)|Queue]]{{·}} [[Priority queue]]{{·}} [[Stack (data structure)|Stack]] |
| − | |group3 = [[ | + | |group3 = [[Array data structure|Array]]s |
| − | |list3 = [[ | + | |list3 = [[Dynamic array]]{{·}} [[Hash table]] |
| − | |group4 = | + | |group4 = Linked |
| − | |list4 = [[ | + | |list4 = [[Linked list]]{{·}} [[Circular buffer|Circular Queue/Buffer]] {{·}}[[Skip list]] |
| − | |group5 = [[Graph (data structure)|Graphs]] | + | |group5 = [[Tree (data structure)|Trees]] |
| − | | | + | |list5 = [[B-tree]]{{·}} [[Binary search tree]] ([[Self-balancing binary search tree|self-balancing]]: [[AA tree|AA]], [[AVL tree|AVL]], [[Red-black tree|red-black]], [[Splay tree|splay]]){{·}} [[Heap (data structure)|Heap]] ([[Binary heap|binary]], [[Binomial heap|binomial]], [[Fibonacci heap|Fibonacci]]) |
| + | |||
| + | |group6 = [[Graph (data structure)|Graphs]] | ||
| + | |list6 = [[Directed graph]]{{·}} [[Directed acyclic graph]]{{·}}[[Binary decision diagram]] {{·}} [[Hypergraph]] | ||
|below = [[List of data structures]] | |below = [[List of data structures]] | ||