Main Page: Difference between revisions

From Algowiki
Jump to navigation Jump to search
No edit summary
 
(38 intermediate revisions by 6 users not shown)
Line 1: Line 1:
== News ==
* <math>LaTeX</math> [http://www.mediawiki.org/wiki/Manual:Math available now!]
* ToDo List added
* Every content has to be in English!
* [http://www.mediawiki.org/wiki/Extension:SyntaxHighlight_GeSHi Syntaxhighlight]
== Rules ==
* Add finalized reconstructions of the old Wiki to Category:Checkup.
* Don't any non-Weihe content until the reconstructions isn't finished.
* Keep your active reconstructing Pages in "Division of labor" section up to date!
== Divison of labor ==
* Fabio Cuozzo - Problems on Sequences
* Daniel Kratschmann - Problems
* Jan Hohmann - B-Tree
* Jan Rathjens - Ford-Fulkerson
* Thomas Lautenschläger - ???
== Page Status ==
Final: [[:Category:Checkup]]
== To Do ==
=== Notations ===
=== Notations ===
* [[Asymptotic notation]]
* [[Big O notation]]
* [[L' Hospital]]
* [[L' Hospital]]
* [[Master theorem]]
* [[Master theorem]]
* [[Asymptotic comparison of functions]]
=== Problems ===
=== Problems ===
* [[Maximum matching problem]]
* [[Matchings in graphs#Cardinality-maximal matching|Maximum matching problem]]
* [[Max-Flow Problems]]
* [[Max-Flow Problems]]
* [[Min-Cost Flow Problems]]
* [[Min-Cost Flow Problems]]
Line 32: Line 12:
** [[All pairs shortest paths]]
** [[All pairs shortest paths]]
*** [[Floyd-Warshall]]
*** [[Floyd-Warshall]]
*** [[Bellman-Ford]]
*** [[Bellman-Ford]] (DONE)
*** [[Shortest paths by repeated squaring]] (variant of Bellman-Ford)  
*** [[Shortest paths by repeated squaring]] (variant of Bellman-Ford)  
** [[Single source shortest paths]]
** [[Single source shortest paths]]
*** [[Dijkstra]]
*** [[Dijkstra]]
** [[Single source single target shortest paths]]
** [[Single source single target shortest paths]]
*** [[A*]]
*** [[A*]] (Empty in old wiki)
* [[Maximum spanning forest]]
* [[Maximum spanning forest]]
* [[Problems on Sequences]]
* [[Problems on Sequences]]
Line 53: Line 33:


=== Coding Basics ===
=== Coding Basics ===
* [[Heritage]]
* [[Inheritance]]
* [[Generics]]
* [[Generics]]
* [[Collections]]
* [[Collections]]
Line 65: Line 45:
=== Sorting Algorithms ===
=== Sorting Algorithms ===
* [[Bubble]]
* [[Bubble]]
* [[Insertion Sort]]
* [[Insertion sort]]
* [[Quick Sort]]
* [[Quicksort]]
* [[Bubble Sort]]
* [[Bubblesort]]
* [[Merge Sort]]
* [[Mergesort]]
* [[Bucket Sort]]
* [[Bucketsort]]
* [[Selection Sort]]
* [[Selection sort]]
* [[Bogo Sort]]
* [[Bogosort]]


=== Search Algorithms ===
=== Search Algorithms ===
* [[Binary Search]]
* [[Binary search]]
 
=== Auxillary Algorithms ===
* [[Pivot partitioning by scanning]]
 
=== Manipulation ===
* [[Array list: find]]
* [[Array list: find at position]]
* [[Array list: insert at head]]
* [[Array list: insert at position]]
* [[Array list: number]]
* [[Array list: remove]]
* [[Doubly-linked list: insert at position]]
* [[Doubly-linked list: insert at tail]]
* [[Doubly-linked list: remove]]
* [[Find element in sequence iteratively]]
* [[Find element in sequence recursively]]
* [[Hashtable: find]]
* [[Hashtable: insert]]


=== Tree Algorithms ===
=== Tree Algorithms ===
* [[Depth-First Search]]
* [[Depth-first search]]
* [[Breadth-First Search]]
* [[Breadth-first search]]
* [[B-Tree:Find]]
* [[B-tree: find]]
* [[B-Tree:Minimum]]
* [[B-tree: minimum]]
* [[B-Tree:Maximum]]
* [[B-tree: maximum]]
* [[B-Tree:Insert]]
* [[B-tree: insert]]
* [[B-Tree:Insert and Rearrange]]
* [[B-tree: insert and rearrange]]
* [[B-Tree:merge two Siblings]]
* [[B-tree: merge two siblings]]
* [[B-Tree:Remove]]
* [[B-tree: remove]]
* [[B-Tree:Shift Key to Sibling]]
* [[B-tree: shift key to sibling]]
* [[B-Tree:Rotate]]
* [[B-tree: split]]
* [[B-Tree:Merge]]
* [[Binary search tree: find]]
* [[B-Tree:Split-Child]]
* [[Binary search tree: minimum]]
* [[Binary Search Tree:Find]]
* [[Binary search tree: maximum]]
* [[Binary Search Tree:Minimum]]
* [[Binary search tree: insert]]
* [[Binary Search Tree:Maximum]]
* [[Binary search tree: remove]]
* [[Binary Search Tree:Insert]]
* [[Binary search tree: remove node]]
* [[Binary Search Tree:Remove]]
* [[Binary search tree: traverse]]
* [[Binary Search Tree:Remove node]]
* [[Binary Search Tree:Traverse]]


=== Graph Theory ===
=== Graph Theory ===
* [[Directed Graph]]
* [[Directed graph]]
* [[Bipartite graphs|Bipartite Graph]] (DONE)
* [[Bipartite graph|Bipartite graph]] (DONE)
* [[k-partite Graph]]
* [[k-partite graph]]
* [[Negative Paths]]
* [[Negative paths]]


=== Graph Algorithms ===
=== Graph Algorithms ===
Line 108: Line 104:
* [[Kruskal]]
* [[Kruskal]]
* [[Prim]]
* [[Prim]]
* [[Bellman-Ford]]
* [[Bellman-Ford]] (DONE)
* [[Floyd-Warshall]]
* [[Floyd-Warshall]]
* [[Union Find]]
* [[Union Find]]
Line 114: Line 110:
* [[Alternating paths algorithm]]
* [[Alternating paths algorithm]]
* [[Johnson]]
* [[Johnson]]
* [[Union-find with disjoint trees: find]]
* [[Union-find with lists: unite]]
* [[Max-flow min-cut]]


=== Flow Algorithms ===
=== Flow Algorithms ===
* [[Ford-Fulkerson]]
* [[Ford-Fulkerson]]
== Abstract Data Structures ==
* [[Edmonds-Karp]]
 
=== Abstract Data Structures ===
*[[Network Structures]]
*[[Network Structures]]
**[[Graph]]
**[[Graph]]
**[[Tree]]
**[[Tree]]
*[[Sequence]]
*[[Sequence]]
**[[Sorted Sequence]]
**[[Sorted sequence]]
**[[Bounded priority queue]]
**[[Bounded priority queue]]
**[[Linear sequence]]
**[[Linear sequence]]
Line 128: Line 129:
**[[Sorted sequence]]
**[[Sorted sequence]]
=== Implementations of Abstract Data Structures  ===
=== Implementations of Abstract Data Structures  ===
* [[Linked List]]
* [[Linked list]]
* [[Array List]]
* [[Array list]]
* [[Binary Search Tree]]
* [[Binary search tree]]
* [[Double Linked List]]
* [[Doubly-linked list]]
* [[Heap as array]] (DONE (Heap as Array))
* [[Heap as array]] (DONE (Heap as Array))
* [[Hashtable]]
* [[Hashtable]]
* [[Multi-way search tree]]
* [[Multi-way search tree]]
* [[Red-Black tree]]
* [[Red-black tree]]
* [[B-tree]]
* [[B-tree]]


Line 141: Line 142:
* [[Min-Max Heaps]]
* [[Min-Max Heaps]]
* [[First In - First Out]]
* [[First In - First Out]]
* [[First In - Ieast Out]]
* [[First In - Last Out]]
* [[Directed Tree]]
* [[Directed Tree]]
* [[Decision Tree]]
* [[Decision Tree]]


=== Other Algorithms (LOCKED) ===
=== Other ===
* [[B*]]
* [[Model computer]]
* [[Cyclic Redundancy Check]]
* [[Eulcid]]
* [[Gauss]]
* [[Discrete Fourier transform]]
* [[Fast Fourier transform]]
* [[Bresenham]]
* [[Round Robin]]
* [[Seperate and Conquer]]
* [[Message-Digest Algorithm]]
* [[Secure Hash Algorithm]]
* [[Sequent calculus]]
* [[Resolution calculus]]
* [[Cocke-Younger-Kasami Algorithm]]
* [[Distance Vector Routing]]
* [[Link State Round]]
* [[Z Buffer Algorithm]]
* [[Marching Squares]]
* [[Marching Cubes]]
* [[Bottom-Up Heapsort]]
* [[Radixsort]]
* [[Median Cut]]
* [[Pancake sorting]]
* [[Karnaugh-Veitch Diagramm]]
* [[Delanuay Triangulation]]
* [[Backtracking]]
* [[Alpha–beta pruning]]
* [[Beam search]]
* [[Best-first search]]
* [[Bidirectional search]]
* [[Borůvka's algorithm]]
* [[Branch and bound]]
* [[D*]]
* [[Depth-limited search]]
* [[Edmonds' algorithm]]
* [[Fringe search]]
* [[Hill climbing]]
* [[IDA*]]
* [[Iterative deepening depth-first search]]
* [[Jump point search]]
* [[Lexicographic breadth-first search]]
* [[SMA*]]
* [[Uniform-cost search]]
 
=== Other Data Structures (LOCKED) ===
* [[Adelson-Velskii and Landis' tree]]
* [[Patricia-Trie]]
* [[Suffix Tree]]
* [[Huffmann Tree]]
* [[Binary Expression Tree]]
* [[Hash Set]]
* [[Incidence Matrix]]
* [[Voronoi Diagramm]]
* [[Quad Tree]]
* [[Oct Tree]]
* [[kd Tree]]
* [[Binary space partitioning]]

Latest revision as of 15:13, 30 November 2020

Notations

Problems

Coding Basics

String Matching Algorithms

Sorting Algorithms

Search Algorithms

Auxillary Algorithms

Manipulation

Tree Algorithms

Graph Theory

Graph Algorithms

Flow Algorithms

Abstract Data Structures

Implementations of Abstract Data Structures

???

Other