forked from nonstriater/Learn-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
冉文杰
committed
Mar 21, 2017
1 parent
3dc017a
commit 5d5cf23
Showing
1 changed file
with
16 additions
and
35 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,40 +1,21 @@ | ||
## A*寻路算法: | ||
求解最短路径 | ||
|
||
## Dijkstra:最短路径算法 | ||
>Dijkstra是荷兰的计算机科学家,提出”信号量和PV原语“,"解决哲学家就餐问题",”死锁“也是它提出来的 | ||
##DP (Dynamic Programming) | ||
动态规划 | ||
|
||
##BFS/DFS (广度/深度优先遍历) | ||
|
||
|
||
##红黑树 | ||
|
||
一种自平衡的`二叉查找树` | ||
|
||
##KMP 字符串匹配算法 | ||
|
||
##遗传算法 | ||
|
||
##启发式搜索 | ||
## 15个经典基础算法 | ||
|
||
##图像特征提取之SIFT算法 | ||
|
||
|
||
##傅立叶变换 | ||
|
||
|
||
##Hash | ||
|
||
|
||
##快速排序 | ||
|
||
|
||
##SPFA(shortest path faster algorithm) | ||
单元最短路径算法 | ||
|
||
* A*寻路算法 :求解最短路径 | ||
* Dijkstra:最短路径算法 | ||
>Dijkstra是荷兰的计算机科学家,提出”信号量和PV原语“,"解决哲学家就餐问题",”死锁“也是它提出来的 | ||
##快递选择SELECT | ||
* 动态规划 (Dynamic Programming) | ||
* BFS/DFS (广度/深度优先遍历) | ||
* 红黑树 一种自平衡的`二叉查找树` | ||
* KMP 字符串匹配算法 | ||
* 遗传算法 | ||
* 启发式搜索 | ||
* 图像特征提取之SIFT算法 | ||
* 傅立叶变换 | ||
* Hash | ||
* 快速排序 | ||
* SPFA(shortest path faster algorithm) 单元最短路径算法 | ||
* 快递选择SELECT | ||
|