![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法
文章平均质量分 80
Luuunh
这个作者很懒,什么都没留下…
展开
-
Dijkstra's 最短路径算法能不能解这个含有负权重的问题
Q. Does Dijkstra's algorithm work with negative weights? A. Yes and no. There are two shortest paths algorithms known as Dijkstra's algorithm, depending on whether a vertex can be enqueued on the pr转载 2018-01-24 18:06:53 · 2311 阅读 · 0 评论 -
机器学习——吴恩达 week3
机器学习——吴恩达 week31: logistic regression: hypothesis: 0<h<1, 表示条件概率,sigmoid函数 decision boundary: theta' * x表示边界。 cost function: y=1,h=0 cost=无穷;y=0,h=1 cost=无穷; y=1,h...原创 2018-02-12 14:56:58 · 309 阅读 · 0 评论