Difference between revisions of "Algorithm classification"
Jump to navigation
Jump to search
[quality revision] | [quality revision] |
Line 27: | Line 27: | ||
# <div id="Numerical integration methods">'''Numerical integration methods'''</div> | # <div id="Numerical integration methods">'''Numerical integration methods'''</div> | ||
# <div id="Graph algorithms">'''Graph algorithms'''</div> | # <div id="Graph algorithms">'''Graph algorithms'''</div> | ||
+ | ## [[Single Source Shortest Path (SSSP)]] | ||
+ | ## [[All Pairs Shortest Path (APSP)]] | ||
+ | ## [[Transitive closure of a directed graph]] | ||
+ | ## [[Construction of the minimum spanning tree (MST)]] | ||
+ | ## [[Search for isomorphic subgraphs]] | ||
+ | ## [[Graph connectivity]] | ||
+ | ## [[Finding maximal flow in a transportation network]] | ||
+ | ## [[Assignment problem]] | ||
# <div id="Search algorithms">'''Search algorithms'''</div> | # <div id="Search algorithms">'''Search algorithms'''</div> | ||
# <div id="Sorting algorithms">'''Sorting algorithms'''</div> | # <div id="Sorting algorithms">'''Sorting algorithms'''</div> |
Revision as of 18:14, 4 August 2015
- Vector operations
- Matrix-vector multiplication
- Matrix operations
- Matrix decomposition
- Triangular decomposition
- Unitary-triangular decomposition
- Decomposition into unitary and Hessenberg matrices
- Decomposition into unitary and diagonal matrices
- Solution of linear equations systems
- Direct methods
- Matrices of a special form
- Triangular matrices
- Matrices of a special form
- Direct methods
- Computer benchmarks
- Fourier transform
- Algebra of polynomials
- Numerical integration methods
- Graph algorithms
- Search algorithms
- Sorting algorithms
- Computational geometry
- Computer graphics
- Cryptographic algorithms
- Neural networks
- Optimization algorithms
- Game theory algorithms
- Algorithms of quantum system simulation
- Algorithms of quantum computation simulation
- Algorithms for solving equations of mathematical physics
- Other algorithms