Main Page: Difference between revisions
Jump to navigation
Jump to search
| Line 56: | Line 56: | ||
* [[Depth-First Search]] | * [[Depth-First Search]] | ||
* [[Breadth-First Search]] | * [[Breadth-First Search]] | ||
* [[B-Tree Rotate]] | * [[B-Tree:Find]] | ||
* [[B-Tree Merge]] | * [[B-Tree:Insert]] | ||
* [[B-Tree Split]] | * [[B-Tree:Insert and Rearrange]] | ||
* [[Binary Search Tree Traverse]] | * [[B-Tree:merge two Siblings]] | ||
* [[B-Tree:Remove]] | |||
* [[B-Tree:Shift Key to Sibling]] | |||
* [[B-Tree:Rotate]] | |||
* [[B-Tree:Merge]] | |||
* [[B-Tree:Split]] | |||
* [[Binary Search Tree:Find]] | |||
* [[Binary Search Tree:Insert]] | |||
* [[Binary Search Tree:Remove]] | |||
* [[Binary Search Tree:Remove Node]] | |||
* [[Binary Search Tree:Traverse]] | |||
=== Graph Theory === | === Graph Theory === | ||
Revision as of 23:25, 11 September 2014
News
- [math]\displaystyle{ LaTeX }[/math] available now!
- ToDo List added
- Every content has to be in English!
- Syntaxhighlight
To Do
Notations
Problems
- Maximum matching problem
- Max-Flow Problems
- Min-Cost Flow Problems
- Shortest Paths Problems
- Maximum spanning forest
- Problems on Sequences
Coding Basics
String Matching Algorithms
Sorting Algorithms
Search Algorithms
Tree Algorithms
- Depth-First Search
- Breadth-First Search
- B-Tree:Find
- B-Tree:Insert
- B-Tree:Insert and Rearrange
- B-Tree:merge two Siblings
- B-Tree:Remove
- B-Tree:Shift Key to Sibling
- B-Tree:Rotate
- B-Tree:Merge
- B-Tree:Split
- Binary Search Tree:Find
- Binary Search Tree:Insert
- Binary Search Tree:Remove
- Binary Search Tree:Remove Node
- Binary Search Tree:Traverse
Graph Theory
Graph Algorithms
Flow Algorithms
Data Structures
- Linked List
- Array List
- First In - First Out
- First In - Ieast Out
- Double Linked List
- Heaps
- Min-Max Heaps
- Hash Table
- Directed Tree
- Binary Search Tree
- B-Trees
- Decision Tree
- Red-Black Tree
- Graphs
Other Algorithms (LOCKED)
- b*
- Cyclic Redundancy Check
- Eulcid
- Gauss
- 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