Main Page: Difference between revisions
Jump to navigation
Jump to search
| Line 15: | Line 15: | ||
* [[Shortest Paths Problems]] | * [[Shortest Paths Problems]] | ||
** [[All pairs shortest paths]] | ** [[All pairs shortest paths]] | ||
*** [[Floyd-Warshall]] | |||
*** [[Bellman-Ford]] | |||
*** [[Shortest paths by repeated squaring]] (variant of Bellman-Ford) | |||
** [[Single source shortest paths]] | ** [[Single source shortest paths]] | ||
*** [[Dijkstra]] | |||
** [[Single source single target shortest paths]] | ** [[Single source single target shortest paths]] | ||
*** [[A*]] | |||
* [[Maximum spanning forest]] | * [[Maximum spanning forest]] | ||
* [[Problems on Sequences]] | * [[Problems on Sequences]] | ||
| Line 30: | Line 35: | ||
*** [[Sorting based on pairwise comparison]] | *** [[Sorting based on pairwise comparison]] | ||
*** [[Sorting Sequences of Strings]] | *** [[Sorting Sequences of Strings]] | ||
=== Coding Basics === | === Coding Basics === | ||
* [[Heritage]] | * [[Heritage]] | ||
Revision as of 23:34, 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