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

【109-week3】第三周总结 #905

Open
quanhoucun opened this issue May 19, 2019 · 0 comments
Open

【109-week3】第三周总结 #905

quanhoucun opened this issue May 19, 2019 · 0 comments

Comments

@quanhoucun
Copy link
Contributor

之前五一放假就把第三周的作业给落下了..
还是算法训练营的老师们认真负责,可以及时提醒到我
这周的算法主要是堆,图,深度优先和广度优先
优先是堆的主要应用场景还是在一遍遍历中取出第K大 或第K小的元素
图就是邻接表,逆邻接表
深度优先和广度优先都是基于图的
主要还是用来求两点的之间的有效路径,以及最短路径等场景
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@quanhoucun