‎Let $G$ be a simple graph with an orientation $sigma$‎, ‎which‎ ‎assigns to each edge a direction so that $G^sigma$ becomes a‎ ‎directed graph‎. ‎$G$ is said to be the underlying graph of the‎ ‎directed graph $G^sigma$‎. ...