This library provides a Python implementation of Uniform-cost search (a variant of Dijkstra's algorithm) that is lazily evaluated. This means that the algorithm is able to generate the graph that is being searched in a lazy fashion, given only:
- the starting node
- a function that generates the neighbors of a node
- a function that determines if the given node is the goal node