Delivery Application of Euler Circuits with Eulerizing in Graph Theory

The video includes explanations of basic vocabulary (walks, trails, closed, closed walks, closed trails, circuits, Euler circuits) which you need to understand how to use Euler circuits to solve a delivery application. Euler's theorem is used to determine if a graph has an Euler circuit. We then Eulerize a graph that does not have an Euler circuit and find an Euler circuit in a multigraph by finding non-overlapping circuits and joinging them into one large Euler circuit that hits every edge once. We also consider how to Eulerize a graph when pairs of odd vertices are not conveniently positioned.

[@Kishimita7204]

This is helping me in discrete class thanks Professor.

[@MzMath]

Awesome! I hope it goes smoothly for you!