算法图解-笔记
11小零童
这个作者很懒,什么都没留下…
展开
-
Dijkstra’s algorithm-Python代码实现
Saving in Hash Tablegraph = {}#因为里面嵌套太多hash table所以不从start开始,把start作为parent的node的距离作为其本身costgraph['A'] = {}graph['A']['Fin'] = 1graph['B'] = {}graph['B']['A'] = 3graph['B']['Fin'] = 5graph['Fin'] = {}infinity = float("inf")costs ={}costs['A'原创 2021-02-23 01:41:13 · 115 阅读 · 0 评论 -
《算法图解》笔记-Breath-first search
Breath-first search(BFs)解决两种问题:Is there a path from node A to node B?A和B之间是否存在路径What is the shortest path from node A to node B?寻找最短路径步骤:1. 用graph表示问题Graph:由nodes和edges构成neighbors: 直接相连的nodesDirected Graph: 定向的,只能由一个方向指向另一个。Undirect原创 2021-02-20 06:43:06 · 392 阅读 · 0 评论 -
《算法图解》笔记-Binary Search
@Binary Search AlgorithmBinary Search前提一定要是:A sorted list.算法过程找出中间元素;与target num 进行比较:“=” => 搜索过程结束;middle > target => left = mid-1middle < target => right = mid+1继续循环比较直到 left > right如果在某一步骤数组为空,则代表找不到。代码实现Python原创 2021-02-06 18:53:09 · 131 阅读 · 1 评论