Personal website Rudolf Adamkovič

Home / Computer science / Breadth-first search (BFS)

Connection to logic

Breadth-first search is analogous to the universal quantifier 1.

Footnotes:

1

Discovered after defining DFS and BFS symmetrically with “some” and “all”.

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