Feed Entities Podcasts Deep Dives Developers About

[KongchangAI]

Real-time AI knowledge base. Every claim is traceable to its source, with data freshness under 24 hours.

Powered by 240+ first-hand AI sources

Knowledge

Feed
Hot Entities
Podcasts

Developers

CLI
MCP Server
REST API
About

© 2026 KongchangAI. The freshest, most accurate AI knowledge

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% similar UnverifiedPrim算法从任意节点出发逐步将最小权重边纳入生成树，配合优先队列可达O(E log V)68% similar UnverifiedBFS借助队列实现，从源节点逐层访问相邻节点，时间复杂度为O(V+E)，是求无权图最短路径的经典方法56% similar Unverified浮点转字符串问题与数论中的连分数理论和 Stern-Brocot 树有深层联系，寻找区间内分母最小的有理数等价于在 Stern-Brocot 树中搜索55% similar UnverifiedDBSCAN不需要预先指定聚类数量，通过邻域半径ε和最小点数MinPts自动发现任意形状的簇并标记离群点为噪声52% similar

Cite This Claim

Stable URI

https://kongchang.com/claim/501916

API

curl https://kongchang.com/api/v1/knowledge/claims/501916

MCP

get_claim(id=501916)