Introduction to Eulerian paths and circuits. Learn the mathematical conditions required for a graph to have a path that visits every edge exactly once.