directed hypergraph
Generalized digraph in which generalized arcs connect one, two, or more nodes
EntityQ130336054
Also known as hyperdigraph
- Subclass of
Overview
All data
4 statements · 0% with external sources · numbers in brackets are citations
Generalized digraph in which generalized arcs connect one, two, or more nodes
Also known as hyperdigraph
4 statements · 0% with external sources · numbers in brackets are citations
From Wikipedia, the free encyclopedia · Read full article · Text CC BY-SA 4.0
In mathematics, a hypergraph is a generalization of a graph in which an edge can join any number of vertices. In contrast, in an ordinary graph, an edge connects exactly two vertices.