Weighted hypergraph
= Weighted hypergraph
{title2=$(V,E,w)$}
A <hypergraph> with a specified numerical weight $w(e)$ for each <hyperedge> $e\in E$. In a <hypergraph cut function>, the weight records the cost or benefit of splitting a <hyperedge> between two sides. Signed weights and nonnegative weights lead to different <submodularity> properties.