This is a small graph library based on Haskell's fgl
library but specialized for simple (undirected, no self-loops), sparse
graphs, where the vertex numbers are typically the integers [1..n], where
n is the order of the graph.
We use some proofs on primitives, so this has idris2-prim as a dependency.