Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
A path in a hypergraph is a sequence \$P = (v_1, e_1, \ldots, e_{n-1}, v_n), v_i \in X, e_i \in E\$\$P = (v_1, e_1, v_2, e_2, \ldots, e_{n-1}, v_n), v_i \in X, e_i \in E\$, and its weight is
$$
W(P) = \sum_{i = 1}^{n - 1} E(e_i).
$$
A path in a hypergraph is a sequence \$P = (v_1, e_1, \ldots, e_{n-1}, v_n), v_i \in X, e_i \in E\$, and its weight is
$$
W(P) = \sum_{i = 1}^{n - 1} E(e_i).
$$
A path in a hypergraph is a sequence \$P = (v_1, e_1, v_2, e_2, \ldots, e_{n-1}, v_n), v_i \in X, e_i \in E\$, and its weight is
$$
W(P) = \sum_{i = 1}^{n - 1} E(e_i).
$$
A path in a hypergraph is a sequence \$P = (v_1, e_1, \ldots, e_{n-1}, v_n), v_i \in X, e_i \in E\$, and its weight is
$$
W(P) = \sum_{i = 1}^{n - 1} E(e_i).
$$
A path in a hypergraph is a sequence \$P = (v_1, e_1, \ldots, e_{n-1}, v_n), v_i \in X, e_i \in E\$, and its weight is
$$
W(P) = \sum_{i = 1}^{n - 1} E(e_i).
$$
