Definition: A connection between any number of vertices of a hypergraph.
Formal Definition: A hyperedge is a set of vertices of a hypergraph.
Aggregate parent (I am a part of or used in ...)
See also edge, graph, directed graph, undirected graph, weighted graph.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 3 November 2005.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "hyperedge", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 3 November 2005. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/hyperedge.html