I wrote Hode[1], a library for a generalization of graphs. Relatiionships in Hode can have any number of members, and those members can themselves be relationships. Relationships are "templated"; relationship templates are the natural generalization of edge labels. Hode includes a TUI and a query language resembling natural language. I intended it to be for managing a personal knowledge base. Hode is more expressive than anything I know about, but (so far) harder to use. Encoding things is easy, and search is as easy as I think can be hoped for -- but deciding *how* to encode things turns out to be really hard. So much so that I've ended up using Semantic Synchrony[2] and org-roam[3] instead. [1] https://github.com/JeffreyBenjaminBrown/hode [2] https://github.com/synchrony/smsn [3] https://github.com/org-roam/org-roam On Wed, Feb 24, 2021 at 9:48 AM Henning Thielemann < lemming@henning-thielemann.de> wrote:
On Wed, 24 Feb 2021, Ignat Insarov wrote:
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?
I wrote this package: http://hackage.haskell.org/package/comfort-graph
The goal was to have more descriptive node and edge identifiers than Int and the ability to mix directed and undirected edges._______________________________________________ Haskell-Cafe mailing list To (un)subscribe, modify options or view archives go to: http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe Only members subscribed via the mailman list are allowed to post.
-- Jeff Brown | Jeffrey Benjamin Brown LinkedIn https://www.linkedin.com/in/jeffreybenjaminbrown | Github https://github.com/jeffreybenjaminbrown | Twitter https://twitter.com/carelogic | Facebook https://www.facebook.com/mejeff.younotjeff | very old Website https://msu.edu/~brown202/