liveBook · Manning

Hypergraph

As explained in Optimization Algorithms: AI techniques for design, planning, and control problems

A hypergraph is a generalization of a graph whose hyperedges can connect any number of vertices.

A hypergraph generalizes a graph by allowing one hyperedge to connect any number of vertices rather than exactly two. It suits relationships involving groups, such as hyperedge 0 linking A, B, and G. section 3.1

Representing a hypergraph with HyperNetX

Store each hyperedge as an identifier mapped to its vertices, then construct and draw the hypergraph: 0 maps to A, B, and G; 1 maps to A, C, D, E, and F; 2 maps to B and F; and 3 maps to A, B, D, E, F, and G.

How Optimization Algorithms: AI techniques for design, planning, and control problems covers it

How deep it goes
Defines hypergraphs and demonstrates construction and drawing, but does not develop algorithms or internal representations.
Examples
Uses four HyperNetX hyperedges, including sets of two, three, five, and six vertices.
What you can do after
Builds and draws a hypergraph from vertex sets using HyperNetX.
How it connects
Connects hypergraphs with graphs, vertices, edges, and HyperNetX.
Cover of Optimization Algorithms: AI techniques for design, planning, and control problems
liveBookmanning.com
Read Optimization Algorithms: AI techniques for design, planning, and control problems on liveBook Get the book at manning.com

Also explained in

Compare how 2 books explain hypergraph →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Optimization Algorithms: AI techniques for design, planning, and control problems. The section links point to the parts of the book it draws on.