Replying to @TheBestqueenx
According to the mathematical principle of Eulerian paths:
An Eulerian path can only exist in a graph with at most two vertices of odd degree.
Since your diagram has four vertices of odd degree,
it is not possible to traverse all paths exactly once without repeating.