February 24, 2021 10:19 PM, "Ignat Insarov"
I have been trying to make graphs resemble a comonad… but of course you can have an empty graph, and a comonad cannot be empty.
You may be interested in the `Extend` class from `semigroupoids`, which is "`Comonad` without `extract`": https://hackage.haskell.org/package/semigroupoids-5.3.5/docs/Data-Functor-Ex...
So, is there any cool library that I missed? Or some promising research? Do you know of any packages that use graphs heavily and in interesting ways? Are you curious to see progress in this area?
Not strictly a package about graph representation, but I always liked how easily functions from search-algorithms plugged into my projects: https://hackage.haskell.org/package/search-algorithms-0.3.1/docs/Algorithm-S... There's also the "Algebraic Graphs with Class" functional pearl, which you might already be aware of: https://eprint.ncl.ac.uk/file_store/production/239461/EF82F5FE-66E3-4F64-A1A... HTH, -- Jack