# HyperGraphs are more memory efficient than graphs

#### Nov 11, 2020

A graph whose nodes have for attributes graphs are not an hypergraph. Hypergraph do not modify the definition of a node, only the definition of an (hyper) edge.From the best AGI project out there:

A hypergraph is much like a graph, except that the edges, now called “hyperedges” can contain more than two vertexes. That is, the hyperedge, rather than being an ordered pair of vertexes, is an ordered list of vertexes.The metagraph takes the hypergraph concept one step further: the hyperedge may also contain other hyperedges.https://github.com/opencog/atomspace/blob/master/opencog/she...