Personal website Rudolf Adamkovič

Home / Computer science

Depth-first search (DFS)

A generic search that

tests some not-yet-searched adjacent vertex 1

and then searches it using DFS.

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.