Let $\Delta$ be the root system of a complex simple Lie algebra, $\Delta^+$ be positive roots and $\Pi$ be simple roots. We view $\Pi$ as nodes of the Dynkin diagram.

Then for any two simple roots $\alpha$ and $\beta$, whether a linear combination $n\alpha+m\beta$ is a root can be judged easily from the Dynkin diagram.

My question is how to do this further. Precisely,

**Question:**

Given non-negative integers $(n_\alpha)_{\alpha\in\Pi}$, is there a combinatorial criterion to judge whether $\sum_{\alpha\in\Pi}n_\alpha\alpha$ is a root?

Is there a recursive way to enumerate all the $(n_\alpha)$'s such that $\sum_{\alpha\in\Pi}n_\alpha\alpha$ is a root?

In particular, how to determine combinatorially the $(n_\alpha)$ corresponding to the highest root?