#+title: Notes
* so, just traversal doesn' work,
and it's easy to imagine why.
my guess is that i really should put 'paths to explore' into priority queue

and select new ones not only by their length, but also by how far they go from the goal

* lot's of time for no result
* so, for 'dijksra' don't store set of vertices,
but of ways we've entered them