What is an Euler Path?

Approach: Define a path that visits every edge exactly once.

A trail in a finite graph which visits every edge exactly once. For it to exist, at most two vertices can have odd degrees.

Follow-up: What is an Euler Circuit?

Key concepts: degrees, connectivity, konigsberg.