Unverified60% confidenceFactExact time
Dijkstra'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.
2
Sources
60%
Confidence
Long-term
Relevance
7/13/2026
First Seen
Sources
图论算法交互式可视化：让BFS、DFS和最短路径一目了然
Related Claims
VerifiedDijkstra's algorithm was proposed by Dutch computer scientist Edsger Dijkstra in 1956, with a time complexity of O((V+E)logV).84% similarUnverified关注点分离原则最早由荷兰计算机科学家Dijkstra在1970年代系统阐述70% similarUnverifiedThe divsteps algorithm was originally proposed by Bernstein and Yang in 2019; it is an iterative method for computing polynomial greatest common divisors and modular inverses, involving only additions, subtractions, and shifts in each step, making it naturally suited to reversible implementation.66% 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.61% similarUnverified关注点分离（Separation of Concerns）是软件工程的核心设计原则，由计算机科学先驱Edsger Dijkstra于1974年首次提出61% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/501914API
curl https://kongchang.com/api/v1/knowledge/claims/501914MCP
get_claim(id=501914)