Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

《计算智能》笔记 - 陈燊的博客 #148

Open
chenshen03 opened this issue Feb 23, 2019 · 0 comments
Open

《计算智能》笔记 - 陈燊的博客 #148

chenshen03 opened this issue Feb 23, 2019 · 0 comments
Labels
fed2f958dbbe4531acdb232b56e4b2d7 Gitalk

Comments

@chenshen03
Copy link
Owner

https://chenshen.xyz/categories/study/%E3%80%8A%E8%AE%A1%E7%AE%97%E6%99%BA%E8%83%BD%E3%80%8B%E7%AC%94%E8%AE%B0/

最优化算法广度优先搜索总是在某一深度上先搜索所有节点，之后搜索下一个深度的节点，能保证一定可以得到最优解，但需要生成大量节点，并且有可能导致组合爆炸，搜索效率低。
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
fed2f958dbbe4531acdb232b56e4b2d7 Gitalk
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@chenshen03