dijkstra algorithm in Python #226
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
| 我觉得当priority发生变化之后，如果用heapify，它是O(n)的复杂度，最后就导致Dijkstra's algorithm变成O(V^2). |
| 你说得对… 写的时候偷懒了直接用haepq提供的堆化方法，这个复杂度就成O(n)了。 插入和改变优先级，都只需堆化一个节点，堆化堆里的某一节点，是O(logn)的。 不过这里要改某个顶点的优先级，又要去堆里定位，而遍历堆元素查找又是O(n)…… 想不到好办法😂 |
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
3 participants
Add this suggestion to a batch that can be applied as a single commit. This suggestion is invalid because no changes were made to the code. Suggestions cannot be applied while the pull request is closed. Suggestions cannot be applied while viewing a subset of changes. Only one suggestion per line can be applied in a batch. Add this suggestion to a batch that can be applied as a single commit. Applying suggestions on deleted lines is not supported. You must change the existing code in this line in order to create a valid suggestion. Outdated suggestions cannot be applied. This suggestion has been applied or marked resolved. Suggestions cannot be applied from pending reviews. Suggestions cannot be applied on multi-line comments. Suggestions cannot be applied while the pull request is queued to merge. Suggestion cannot be applied right now. Please check back later.
No description provided.