Main Page: Difference between revisions

From Algowiki
Jump to navigation Jump to search
No edit summary
 
(110 intermediate revisions by 8 users not shown)
Line 1: Line 1:
== News ==
=== Notations ===
* <math>LaTeX</math> jetzt aktiv!
* [[Big O notation]]
* ToDo Liste hinzugefügt
* [[L' Hospital]]
== To Do ==
* [[Master theorem]]
== Notations ==
* [[Asymptotic comparison of functions]]
* [[Asymptotic notation]]
 
=== Problems ===
* [[Matchings in graphs#Cardinality-maximal matching|Maximum matching problem]]
* [[Max-Flow Problems]]
* [[Min-Cost Flow Problems]]
* [[Shortest Paths Problems]]
** [[All pairs shortest paths]]
*** [[Floyd-Warshall]]
*** [[Bellman-Ford]] (DONE)
*** [[Shortest paths by repeated squaring]] (variant of Bellman-Ford)
** [[Single source shortest paths]]
*** [[Dijkstra]]
** [[Single source single target shortest paths]]
*** [[A*]] (Empty in old wiki)
* [[Maximum spanning forest]]
* [[Problems on Sequences]]
** [[Basic Problems on Sequences]]
*** [[Find an element in a sequence]] (DONE)
*** [[Insert an element in a sequence]] (Empty in old wiki?!)
*** [[Median]] (DONE)
*** [[Merging two sorted sequences]] (DONE)
** [[Pattern Matching]]
*** [[One-dimensional string matching]] (DONE)
*** [[String matching]] (DONE)
** [[Sorting]]
*** [[Sorting based on pairwise comparison]] (DONE)
*** [[Sorting Sequences of Strings]] (DONE)
 
=== Coding Basics ===
=== Coding Basics ===
* [[Inheritance]]
* [[Generics]]
* [[Generics]]
* [[Collections]]
** [[Iterator]]
** [[Comparator]]
=== 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 ===
* [[Insertion Sort]]
* [[Bubble]]
* [[Insertion sort]]
* [[Quicksort]]
* [[Quicksort]]
* [[Bubblesort]]
* [[Bubblesort]]
* [[Mergesort]]
* [[Mergesort]]
* [[Bucketsort]]
* [[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]]
* [[B-Tree Rotate]]
* [[Breadth-first search]]
* [[B-Tree Merge]]
* [[B-tree: find]]
* [[B-Tree Split]]
* [[B-tree: minimum]]
* [[Binary Search Tree Traverse]]
* [[B-tree: maximum]]
* [[B-tree: insert]]
* [[B-tree: insert and rearrange]]
* [[B-tree: merge two siblings]]
* [[B-tree: remove]]
* [[B-tree: shift key to sibling]]
* [[B-tree: split]]
* [[Binary search tree: find]]
* [[Binary search tree: minimum]]
* [[Binary search tree: maximum]]
* [[Binary search tree: insert]]
* [[Binary search tree: remove]]
* [[Binary search tree: remove node]]
* [[Binary search tree: traverse]]
 
=== Graph Theory ===
* [[Directed graph]]
* [[Bipartite graph|Bipartite graph]] (DONE)
* [[k-partite graph]]
* [[Negative paths]]


=== Graph Algorithms ===
=== Graph Algorithms ===
Line 33: Line 104:
* [[Kruskal]]
* [[Kruskal]]
* [[Prim]]
* [[Prim]]
* [[Bellman-Ford]]
* [[Bellman-Ford]] (DONE)
* [[Floyd-Warshall]]
* [[Union Find]]
* [[Union Find]]
* [[a*]]
* [[A*]]
* [[Alternating paths algorithm]]
* [[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 ===
* [[Double Linked List]]
*[[Network Structures]]
* [[Heaps]]
**[[Graph]]
* [[Hash Table]]
**[[Tree]]
* [[Hash Map]]
*[[Sequence]]
* [[Binary Search Tree]]
**[[Sorted sequence]]
* [[B-Trees]]
**[[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 - Last Out]]
* [[Directed Tree]]
* [[Decision Tree]]
* [[Decision Tree]]
* [[Red-Black Tree]]
* [[Graphs]]


=== Other Algorithms ===
=== Other ===
* [[Cyclic Redundancy Check]]
* [[Model computer]]
* [[Eulkid]]
* [[Gauss]]
* [[Fast Fourier Transformation]]
* [[Bresenham]]

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"