Main Page: Difference between revisions

From Algowiki
Jump to navigation Jump to search
No edit summary
 
(69 intermediate revisions by 8 users not shown)
Line 1: Line 1:
== News ==
* <math>LaTeX</math> [http://www.mediawiki.org/wiki/Extension:Math available now!]
* ToDo List added
* Every content has to be in English!
* [http://www.mediawiki.org/wiki/Extension:SyntaxHighlight_GeSHi Syntaxhighlight]
== To Do ==
=== Notations ===
=== Notations ===
* [[Asymptotic notation]]
* [[Big O notation]]
* [[L' Hospital]]
* [[L' Hospital]]
* [[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 16: 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]]
** [[Basic Problems on Sequences]]
** [[Basic Problems on Sequences]]
*** [[Find an element in a sequence]]
*** [[Find an element in a sequence]] (DONE)
*** [[Insert an element in a sequence]]
*** [[Insert an element in a sequence]] (Empty in old wiki?!)
*** [[Median]]
*** [[Median]] (DONE)
*** [[Merging two sorted sequences]]
*** [[Merging two sorted sequences]] (DONE)
** [[Pattern Matching]]
** [[Pattern Matching]]
*** [[One-dimensional string matching]]
*** [[One-dimensional string matching]] (DONE)
*** [[String matching]]
*** [[String matching]] (DONE)
** [[Sorting]]
** [[Sorting]]
*** [[Sorting based on pairwise comparison]]
*** [[Sorting based on pairwise comparison]] (DONE)
*** [[Sorting Sequences of Strings]]
*** [[Sorting Sequences of Strings]] (DONE)


=== Coding Basics ===
=== Coding Basics ===
* [[Heritage]]
* [[Inheritance]]
* [[Generics]]
* [[Generics]]
* [[Collections]]
* [[Collections]]
Line 44: Line 40:


=== String Matching Algorithms ===
=== String Matching Algorithms ===
* [[Simple string matching algorithm]]
* [[Simple string matching algorithm]] (DONE)
* [[String matching based on finite automaton]]
* [[String matching based on finite automaton]] (DONE)


=== 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]]
* [[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]]
* [[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 Graph]]
* [[Bipartite graph|Bipartite graph]] (DONE)
* [[Negative Paths]]
* [[k-partite graph]]
* [[Negative paths]]


=== Graph Algorithms ===
=== Graph Algorithms ===
Line 90: Line 104:
* [[Kruskal]]
* [[Kruskal]]
* [[Prim]]
* [[Prim]]
* [[Bellman-Ford]]
* [[Bellman-Ford]] (DONE)
* [[Floyd Warshall]]
* [[Floyd-Warshall]]
* [[Union Find]]
* [[Union Find]]
* [[A*]]
* [[A*]]
* [[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]]
=== Data Structures ===
* [[Edmonds-Karp]]
* [[Linked List]]
 
* [[Array List]]
=== Abstract Data Structures ===
*[[Network Structures]]
**[[Graph]]
**[[Tree]]
*[[Sequence]]
**[[Sorted sequence]]
**[[Bounded priority queue]]
**[[Linear sequence]]
**[[Priority queue]]
**[[Sorted sequence]]
=== Implementations of Abstract Data Structures  ===
* [[Linked list]]
* [[Array list]]
* [[Binary search tree]]
* [[Doubly-linked list]]
* [[Heap as array]] (DONE (Heap as Array))
* [[Hashtable]]
* [[Multi-way search tree]]
* [[Red-black tree]]
* [[B-tree]]
 
=== ??? ===
* [[Min-Max Heaps]]
* [[First In - First Out]]
* [[First In - First Out]]
* [[First In - Ieast Out]]
* [[First In - Last Out]]
* [[Double Linked List]]
* [[Heaps]]
* [[Min-Max Heaps]]
* [[Hash Table]]
* [[Directed Tree]]
* [[Directed Tree]]
* [[Binary Search Tree]]
* [[B-Trees]]
* [[Decision Tree]]
* [[Decision Tree]]
* [[Red-Black Tree]]
* [[Graphs]]
=== Other Algorithms (LOCKED) ===
* [[B*]]
* [[Cyclic Redundancy Check]]
* [[Eulcid]]
* [[Gauss]]
* [[Discrete Fourier transform]]
* [[Fast Fourier Transformation]]
* [[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]]


=== Other Data Structures (LOCKED) ===
=== Other ===
* [[Adelson-Velskii and Landis' tree]]
* [[Model computer]]
* [[Patricia-Trie]]
* [[Suffix Tree]]
* [[Huffmann Tree]]
* [[Binary Expression Tree]]
* [[Hash Set]]
* [[Bogo Sort]]
* [[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

Retrieved from "https://wiki.algo.informatik.tu-darmstadt.de/index.php?title=Main_Page&oldid=3888"