Main Page: Difference between revisions
Jump to navigation
Jump to search
| Line 142: | Line 142: | ||
* [[Delanuay Triangulation]] | * [[Delanuay Triangulation]] | ||
* [[Backtracking]] | * [[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) === | === Other Data Structures (LOCKED) === | ||
Revision as of 00:09, 17 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:Minimum
- 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:Rotate
- B-Tree:Merge
- 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
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
- 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
- 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