Unverified50% confidenceFactExact time
Kruskal算法将所有边按权重排序后依次加入不形成环的边，底层依赖并查集，时间复杂度为O(E log E)
1
Sources
50%
Confidence
Long-term
Relevance
7/14/2026
First Seen
Sources
图论算法交互式可视化：让BFS、DFS和最短路径一目了然
Related Claims
UnverifiedBVH（层次包围盒）加速结构可使点到复杂几何表面的最近距离查询在O(log n)时间内完成，n为几何面片数68% similarUnverified多智能体并行调度可将总耗时从O(N)降至O(N/K)（K为并行Worker数量），依赖asyncio、Redis Streams消息队列及分布式锁机制64% similarUnverified尾调用优化可将本可能占用 O(n) 栈空间的递归转化为 O(1) 的常量空间消耗61% similarUnverified多智能体并行架构本质上是将链式推理拆解为有向无环图（DAG）式任务调度，可将整体完成时间从O(n)降至接近O(max_subtask)61% similarUnverifiedDeterministic folding circumvents non-determinism by bypassing the LLM generation step (replacing it with a rule engine or deterministic algorithm), guaranteeing that folding results for the same input context are always consistent.61% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/503999API
curl https://kongchang.com/api/v1/knowledge/claims/503999MCP
get_claim(id=503999)