Personal website Rudolf Adamkovič

Home / Computer science

Breadth-first search (BFS)

A generic search that

tests all not-yet-searched adjacent vertices 1

and then searches them using BFS.

Footnotes:

1

No “depth”, to maintain the graph-theoretical perspective of generic search.

© 2025 Rudolf Adamkovič under GNU General Public License version 3.
Made with Emacs and secret alien technologies of yesteryear.