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

'Augmented Sparsifiers for Generalized Hypergraph Cuts', by Nate Veldt, Austin R. Benson, Jon Kleinberg.

http://jmlr.org/papers/v24/22-0305.html

#hypergraph #hyperedge #edges