Pathway XX

↝Graph walks and connectivity

A walk is a sequence of adjacent vertices. Connected means a walk between every pair.

1. 01Walks and connectivityWalks may repeat. Paths do not. Components are the maximal connected pieces.4 min
2. 02Eulerian circuitsAn Eulerian circuit walks every edge exactly once and returns. It exists iff every degree is even.4 min