In real life what are the use cases of Euler paths ?
A path in a multigraph $G$ that includes exactly once all the edges of $G$ and has different first and last vertices is called an Euler path. If this path has the same initial and terminal vertices, we call it an Euler circuit.
Eulerian trails are used in bioinformatics to reconstruct the DNA sequence from its fragments.[12] They are also used in CMOS circuit design to find an optimal logic gate ordering.[13]
Reference Eulerian_path, Wikipedia, https://en.wikipedia.org/wiki/Eulerian_path