返回到 Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
學生對 斯坦福大学 提供的 Shortest Paths Revisited, NP-Complete Problems and What To Do About Them 的評價和反饋
764 個評分
課程概述
The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and what it means for the algorithm designer, and strategies for coping with computationally intractable problems (analysis of heuristics, local search).
熱門審閱
AA
2017年2月27日
This challenging course improves understanding of algorithms and is intellectually stimulating. I learnt the theory behind algorithms and how they are applied to solve real world problems.
AS
2018年8月22日
This is the most challenging course in this specialization. Assignments as well as test questions require good amount of thinking.
One of the best courses I did on Coursera.
篩選依據：
101 - Shortest Paths Revisited, NP-Complete Problems and What To Do About Them 的 103 個評論（共 103 個）
創建者 Thành N K
•2019年9月15日
so hard
創建者 --
•2021年4月27日
Sometimes is really hard to understand, I wish more examples and visualization rather than straightforward speech.
創建者 Xiao Z
•2019年8月17日
Can be expanded more. Some of the quizzes are too hard.
Coursera Footer
© 2022 Coursera Inc.保留所有權利。
