This is a library for working with finite graphs, including a brute force decision procedure for finding a path between two nodes in Data.Graph.Path.Search.
Building requires the following libraries in an Agda libraries file:
- Agda standard library under the name
standard-libarary - https://github.com/kcsmnt0/finite under the name
finite
This code is tested against development versions of the Agda compiler and standard library, and was last tested working on June 21, 2023.