fcf-graphs

fcf-graphs mimicks algebraic-graphs but for type level computations using first-class-families.

Provided are the Graph and AdjacencyMap data types, and several functions for each. I believe this can reach api parity with algebraic-graphs. At the moment, not everything is implemented, but type-level simplify works which is interesting.

Note that ordering of underlying lists/maps is a bit weird so be careful. See the doctests for examples, and see fcf-containers for reference.