31.2 Algorithm

31.2.1 Graph and tree traversal algorithms

Greedy algorithm

31.2.1.1 Search

Breadth-first search (BFS)

Depth-first search (DFS)

31.2.1.1.1 Monte-Carlo tree search

31.2.1.2 Shortest path

31.2.1.2.1 Dijkstra’s Algorithm

31.2.1.3 Minimum spanning tree

31.2.2 Dynamic Programming

https://en.wikipedia.org/wiki/Dynamic_programming https://en.wikipedia.org/wiki/Viterbi_algorithm

31.2.3 Mathematical algorithm

This part is for numeric analysis

cubic spline

https://en.wikipedia.org/wiki/Bareiss_algorithm

https://github.com/bwlewis/irlba

Lanczos algorithm https://en.wikipedia.org/wiki/Lanczos_algorithm https://en.wikipedia.org/wiki/Lanczos_resampling https://en.wikipedia.org/wiki/Lanczos_approximation