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 has been tested against Agda version 2.5.4.2 and standard library version 0.17.