#higraph — Public Fediverse posts

#Higraph progress!

Still got lots to do, but hyperEdges can now be saved & loaded in modified #graphml files. The "model tree" on the left highlights items in the graph on the right.
I can see "minimum viable product"!

The #hyperedge structure is both graphically and algebraically accessible. I'm not aware of anything else that does this, pretty certainly not in #Python
#graphTheory #VisualFormalism

You asked, and here it is: #hyperedges are basically working. 1200 lines of code & changes in 2 weeks - about 50 odd hours of coding. This was not trivial, but hyperedges are a thing.

There are still some features to add (deletion, XML serialisation), and bugs to squash, but the hard work is done.
😁

#Python #Higraph #GraphTheory #PYside6

This image is of a simulation of a simple directed #hypergraph , but using an n-ary line rather than a set for the #hyperedge

I have written a working #graphTheory editor for binary edges, where nodes are extended to sets (a #Higraph) , and am contemplating the complexity of n-ary edges with increasing apprehension. It requires refactoring just about the entire edge drawing codebase - 100's of changes across ~2000 lines of #Python.
Is it worth it? Please comment/ vote in the poll below

A #Higraph milestone: Blobs (nodes as sets) now work! Grab a 'parent' blob, and all the children move. Edges connect anywhere on the blob, and default to be orthogonal to the point of contact. graphML read and write working.

Now on to proper hyperedges!

#Python #Pyside6 #Qt #GraphTheory

Hi #Mathstodon - a #GraphTheory question:
Given the following visual set containment, I can obtain the total containment of every item as a list (text on the left). This intuitively seems sufficient information to derive the containment graph (almost a tree - n7 breaks that).
Are there any 'standard' techniques to apply to this?

Boosts, partial ideas, discussion all welcome.
#Higraph