djikstra 堆优化时间复杂度

通过引用可以得知，使用小根堆可以将查询最小边的时间复杂度压缩到O(logn)。而在引用中给出的代码中，使用了小根堆对djikstra算法进行了优化。因此，使用djikstra堆优化后的时间复杂度为O(logn)。<span class="em">1</span><span class="em">2</span><span class="em">3</span>
#### 引用[.reference_title]
- *1* [[单源最短路径]dijkstra(堆优化)](https://blog.csdn.net/YUK_103/article/details/108965814)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v93^chatsearchT3_2"}}] [.reference_item style="max-width: 50%"]
- *2* *3* [基于leetcode743网络的延迟时间 总结图的最短路径问题(djikstra/djikstra+heap/floyd)](https://blog.csdn.net/weixin_51438023/article/details/120167122)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v93^chatsearchT3_2"}}] [.reference_item style="max-width: 50%"]
[ .reference_list ]