Unverified50% confidenceFactExact time
BFS (Breadth-First Search) visits all nodes at the same level before advancing to the next level, and is the counterpart of DFS.
1
Sources
50%
Confidence
Long-term
Relevance
9/25/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedBFS借助队列实现，从源节点逐层访问相邻节点，时间复杂度为O(V+E)，是求无权图最短路径的经典方法65% similarUnverifiedSerializing Trie nodes into a contiguous byte array in BFS (breadth-first) order places parent and child nodes adjacent in physical memory, improving data locality with cache prefetching.65% similarUnverifiedFocal Search maintains a FOCAL candidate set containing all frontier nodes that satisfy the threshold w·f_min, and uses a heuristic function within this set for guided selection.62% similarUnverifiedThere are two classic implementation algorithms for topological sorting: the reverse post-order method based on depth-first search, and Kahn's algorithm based on in-degree BFS.62% similarUnverifiedThis DFS method uses a multi-select pop-up window to let users check options, retaining selected branches while directly pruning unselected ones.58% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/949745API
curl https://kongchang.com/api/v1/knowledge/claims/949745MCP
get_claim(id=949745)