Unverified50% confidenceFactExact time
Tarjan算法由Robert Tarjan于1972年提出，能在单次DFS中以O(V+E)找出有向图所有强连通分量
1
Sources
50%
Confidence
Long-term
Relevance
7/14/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).52% similarUnverified2010年Larry Guth和Nets Katz利用多项式方法解决了Erdős距离问题，证明n个点至少确定Ω(n/log n)个不同距离52% 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.51% similarUnverified经典的Rete算法由Charles Forgy于1979年提出，通过构建规则网络（有向无环图）高效匹配规则条件，采用增量匹配机制51% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/504003API
curl https://kongchang.com/api/v1/knowledge/claims/504003MCP
get_claim(id=504003)