A directed hypergraph G (Gallo et al., 1993) is a tuple of the form: Similar to regular graphs, a hypergraph consists of a set of nodes X and a set of arcs A.
different from regular graphs, each arc in A is considered as a hyperarc in the sense that it can capture relations between any two subsets of nodes: a tail (t i ) and a head (h i ).