Verified65% confidenceFactExact time
Dijkstra's algorithm was proposed by Dutch computer scientist Edsger Dijkstra in 1956, with a time complexity of O((V+E)logV).
3
Sources
65%
Confidence
Long-term
Relevance
7/14/2026
First Seen
Sources
图论算法可视化工具：免费交互动画让BFS/DFS/Dijkstra一看就懂
Related Claims
UnverifiedDijkstra's algorithm was proposed by Dutch computer scientist Edsger Dijkstra in 1956, and dynamically updates the best known distance from the source node to each node by repeatedly performing relaxation operations.84% similarVerifiedThe Hungarian algorithm was developed by Harold Kuhn in 1955 based on the work of Dénes Kőnig and Jenő Egerváry, has a time complexity of O(n³), and is used for optimal assignment in bipartite graphs.71% similarUnverifiedIn 1987, Fredman and Tarjan proposed the Fibonacci heap, reducing the complexity of Dijkstra's algorithm to the more precise form of O(m + n log n).66% similarUnverifiedMost modern diff tools are based on the difference algorithm proposed by Eugene Myers in 1986, which has a time complexity of O(ND).62% similarUnverified匈牙利算法于1955年提出，以O(n³)时间复杂度解决二分图最优匹配问题62% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/503814API
curl https://kongchang.com/api/v1/knowledge/claims/503814MCP
get_claim(id=503814)