Unverified50% confidenceFactExact time
Kruskal 算法基于并查集按边权排序，Prim 算法类似 Dijkstra 的节点扩展策略，两者均可在 O(ElogE) 内求解最小生成树
1
Sources
50%
Confidence
Long-term
Relevance
7/13/2026
First Seen
Sources
图论算法可视化工具：免费交互动画让BFS/DFS/Dijkstra一看就懂
Related Claims
UnverifiedPrim算法从任意节点出发逐步将最小权重边纳入生成树，配合优先队列可达O(E log V)74% similarUnverified最小生成树（MST）是连接图中所有节点、总边权最小的无环子图，经典算法包括Kruskal算法和Prim算法69% 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.60% similarUnverified词云主流实现采用螺旋线扩展算法配合基于四叉树的空间索引，将碰撞检测时间复杂度从O(n²)降低至O(n log n)量级59% similarUnverified无索引邻接（Index-Free Adjacency）架构使每个节点直接持有指向相邻节点的物理内存指针，查询遍历时间复杂度为O(1)58% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/502305API
curl https://kongchang.com/api/v1/knowledge/claims/502305MCP
get_claim(id=502305)