Commit 2023-04-18 11:25 c9aa46a3

feat: depth first and best first search using ListM (#3221) Implementations of depth first search, best first search, and beam search, for graphs described by a neighbours function α → ListM m α. There are also wrappers for using α → List α. This is only intended for use in meta code.