breadth-first search (Q325904)
algorithm for searching the nodes of a graph in order by their hop count from a starting node
Language:
Current Data About breadth-first search
(P10) Breadth-First-Search-Algorithm.gif
(P18) Image Provided By https://upload.wikimedia.org/wikipedia/commons/3/33/Breadth-first-tree.svg
(P31) (Q4443425)
(P61) (Q60093)
(P279) (Q907955)
(P373) Breadth-first search
(P575) +1945-00-00T00:00:00Z
(P973) https://www.javatpoint.com/ai-uninformed-search-algorithms
(P1482) https://stackoverflow.com/tags/breadth-first-search
(P1813) "BFS" (language: en)
(P2283) (Q2479726)
(Q515636)
(P3752) O(|V|+|E|) = O(b^d)
(P3755) O(|V|) = O(b^d)
other details
aliases BFS
breadth first search
description algorithm for searching the nodes of a graph in order by their hop count from a starting node

External Links