Not sure if “it” refers to this particular package or hyper graphs in general. Simplicial complexes are widely used in mathematics for many decades and they are simply hyper graphs where every subset of an edge is an edge. So take the tetrahedron, for example. If (x1, x2, x3) are connected by a hyperedge (technically one of the triangular faces of the tetrahedron), then (x1,x2), (x1,x3) and (x2,x3) are also hyperedges (the lines bordering the tetrahedron face). A general hypergraph removes the subsets of edges are edges property.

I've been exploring hypergraphs a lot over the last 12 months. They are an incredibly rich way to look at a lot of existing (and new) mathematics, so much so that I think hypergraphs will have a good chance to become a signature mathematical structure over the next 100 years.

Unfortunately people don't yet have a good notion (or notation) for what a hypergraph even is! The wikipedia page is a disaster area, for example. Partly this is due to a lack of careful, general groundwork on how to think about hypergraphs. I'm confident this will get done though -- and aim to play a role in that. My personal view is that you need you really need to adopt an ADT-type viewpoint to do this, but I'll have to leave it at that for now.

The wiki page for hypergraph has some nice applications.

Social media for example.