Inheritance for hypergraph classes

nwlandry commented 1 year ago

We should have Hypergraph inherit from DiHypergraph or vice-versa as well as IDView/DiIDView to avoid overly duplicated code.

nwlandry commented 6 months ago

Some thoughts on this:

We should start by implementing a HigherOrderSystem (HOrS) class with some basic functionality.

All higher-order networks have:

nodes (same for all networks)
interactions (the type of interaction will determine how it is implemented)

For example, interactions can be modeled as a:

set of frozen sets for simple hypergraphs, or a dictionary of sets with some checking.
dictionary of sorted lists for loopy hypergraphs
dictionary of {"in": {<tail>}, "out":{<head>}} dictionaries for dihypergraphs
dictionary of sets for multihypergraphs.

My thought is that we can implement all of the general things except for the edges in the base class and write interaction type-specific functionality in the inherited classes.

nwlandry commented 6 months ago

PR #541 implements the third item. Item 2 is fairly low priority, but when we implement this, Counter might be preferable to a sorted list.

xgi-org / xgi

Inheritance for hypergraph classes #379