Unverified50% confidenceFactExact time

拓扑排序算法（Topological Sort）最早由Kahn于1962年正式描述，其时间复杂度为O(V+E)，V为节点数量、E为连边数量

1

Sources

50%

Confidence

Long-term

Relevance

7/13/2026

First Seen

Sources

UniFlex 11：免费开源Krea 2工作流套件完整解析

redditr/comfyui7/11/2026

Related Claims

VerifiedMap（哈希表）的平均查找时间复杂度为O(1)58% similar Unverified二维数组访问任意位置的时间复杂度为O(1)58% similar Unverified差分启发式若有K个地标，预处理总时间为O(K × (V+E)log V)56% similar Partially VerifiedKL散度的数学形式为D_KL(p||q) = ∑ p(x_i) log(p(x_i)/q(x_i))53% similar UnverifiedJohnson-Lindenstrauss引理指出在n维空间中可以找到指数级于n的近似正交向量集合51% similar

Cite This Claim

Stable URI

https://kongchang.com/claim/501630

API

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

MCP

get_claim(id=501630)