Hypergraph edge/vertex matrix

Convert binary undirected adjacency matrix into a hypergraph matrix.

Hypergraphs are an alternative method to understanding graphs. They provide better insight on the clustering structure underlying a binary network. A hypergraph is represented by an nxm matrix where n is the number of hyperedges and m is the number of vertices in the network.