Unverified50% confidenceSolutionExact time
The Top-K pruning strategy is essentially a branch-and-bound algorithm based on a priority queue (min-heap).
1
Sources
50%
Confidence
Long-term
Relevance
9/10/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThere 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.68% similarUnverifiedReranking is typically implemented using cross-encoders, which concatenate the query and candidate documents before feeding them in together; it usually reranks only the Top-50 to Top-100 candidates and finally selects Top-3 to Top-5 to pass to the generative model.67% similarUnverifiedTop-K检索是从向量数据库中取相似度最高的前K个片段作为候选内容65% similarUnverifiedKruskal 算法基于并查集按边权排序，Prim 算法类似 Dijkstra 的节点扩展策略，两者均可在 O(ElogE) 内求解最小生成树64% similarUnverifiedPrim算法从任意节点出发逐步将最小权重边纳入生成树，配合优先队列可达O(E log V)64% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/887404API
curl https://kongchang.com/api/v1/knowledge/claims/887404MCP
get_claim(id=887404)