In modern language , Euler shows that the possibility of a walk through a graph , traversing each edge exactly once , depends on the degrees of the nodes .
In modern language , Euler shows that whether a walk through a graph crossing each edge once is possible or not depends on the degrees of the nodes .