Unverified50% confidenceFactExact time
最小生成树（MST）是连接图中所有节点、总边权最小的无环子图，经典算法包括Kruskal算法和Prim算法
1
Sources
50%
Confidence
Long-term
Relevance
7/13/2026
First Seen
Sources
图论算法交互式可视化：让BFS、DFS和最短路径一目了然
Related Claims
UnverifiedKruskal 算法基于并查集按边权排序，Prim 算法类似 Dijkstra 的节点扩展策略，两者均可在 O(ElogE) 内求解最小生成树69% similarUnverifiedPrim算法从任意节点出发逐步将最小权重边纳入生成树，配合优先队列可达O(E log V)68% similarUnverifiedBFS借助队列实现，从源节点逐层访问相邻节点，时间复杂度为O(V+E)，是求无权图最短路径的经典方法56% similarUnverifiedThe floating-point to string problem has deep connections with continued fraction theory and Stern-Brocot trees in number theory, and finding the rational number with the smallest denominator within an interval is equivalent to searching in a Stern-Brocot tree.55% similarUnverifiedDBSCAN does not require specifying the number of clusters in advance; it automatically discovers clusters of arbitrary shape through neighborhood radius ε and minimum point count MinPts, and marks outliers as noise.52% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/501916API
curl https://kongchang.com/api/v1/knowledge/claims/501916MCP
get_claim(id=501916)