A small prototype based on
- Ubergraphs a definition of recursive hypergraph structure
Adjacency representation is currently done via a vector of sets. No algorithms have been implemented yet.
- Adding edges and nodes
- Conversion of Levi or Incidence graph into petgraph.
- Everything else
There are lots of rough edges (ownership, Node and edge Index types), in particular due to rusts lack of tail recursion unrolling some of these instances of recursion to avoid stack frames on recursive calls seems like it is going to be painful.