Unverified50% confidenceFactExact time
There are two classic implementation algorithms for topological sorting: the reverse post-order method based on depth-first search, and Kahn's algorithm based on in-degree BFS.
1
Sources
50%
Confidence
Long-term
Relevance
8/24/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedKruskal 算法基于并查集按边权排序，Prim 算法类似 Dijkstra 的节点扩展策略，两者均可在 O(ElogE) 内求解最小生成树67% similarUnverifiedContext Mode使用Reciprocal Rank Fusion算法合并两种搜索策略的排序结果66% similarUnverifiedThe HNSW algorithm achieves hierarchical search by constructing a multi-layer graph structure, approximately reducing the exponential complexity of exact nearest-neighbor search to logarithmic complexity, making it the most mainstream index structure in current vector databases.65% similarUnverifiedThe graph structure of a knowledge graph natively supports graph traversal algorithms, allowing queries such as 'find all places that call function A' to complete in milliseconds.65% similarUnverifiedGradient Boosting算法长期主导Kaggle结构化/表格数据竞赛排行榜，被认为是非图像、非文本数据的默认最优选择64% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/792708API
curl https://kongchang.com/api/v1/knowledge/claims/792708MCP
get_claim(id=792708)