Notes

Lost in a Forest

This is still a work in progress.

The title might be misleading. I’m not lost, nor in a forest 🙂. In this post I’ll share some work that I’ve been doing on specifying iteration.

Cursors

Iteration, be it the traversal of some data structure or the result enumeration of some...

Notes on DFS

The notes from this post build on top of remarks made by David Eppstein.

Depth-first-search, otherwise known as DFS, is a traversal algorithm that aims at exploring a data structure as far down as possible before backtracking. In its counter-part, breadth-first-search traversals, we can define an iterative version using a queue. Enqueuing each successor of a newly visiting node.