1.1 Euler Circuits - Video

Key Ideas

  • The problem of finding an optimal route for checking parking meters or delivering mail can be modeled abstractly as finding a best path through a graph that includes every edge. A graph is a finite set of dots and connecting links. A dot is called a vertex, and the link between two vertices is called an edge.
  • A path through a graph is a circuit if it starts and ends at the same vertex. A circuit is an Euler circuit if it covers each edge exactly once. (Euler is pronounced “Oy’lur.”)