An Eulerian Trail is a trail that uses every edge of a graph exactly once and starts and ends at different vertices. A Eulerian Circuit is a circuit that uses every edge of a network exactly one and starts and ends at the same vertex. The following videos explain Eulerian Trails and Circuits in the QCE General Maths course.
The following video explains this concept further.
Example of Solving Eulerian Trails and Circuits
The following video solves an example using Eulerian trails and circuits
Want to learn more? Check out more of our QCE General Maths resources here!