Machine learningGraph Algorithms
迪杰斯特拉算法
迪杰斯特拉算法由艾兹赫·迪杰斯特拉于1956年提出，是计算机科学中解决单源最短路径问题的最基本算法之一。它能找出图中从起始顶点到所有其他顶点的最短路径，适用于边权重非负的加权图。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269-271. DOI: 10.1007/BF01386390 ↗
- Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms (3rd ed.). MIT Press. ISBN: 978-0-262-03384-8
如何引用本页
ScholarGate. (2026, June 3). Dijkstra Algorithm for Shortest Path. ScholarGate. https://scholargate.app/zh/operations-research/dijkstra-algorithm
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
Compare side by side →