Where to start and finish, and bridges Kudos to authors for monetizing some very basic graph theory (the topic here is Eulerian circuits and Eulerian trails). Check how many edges sticks out of each vertex. That’s called the “degree” of a vertex. If all vertices have even degrees, then choose any vertex as both your start and finish. If exactly 2 vertices have odd degrees, then those 2 vertices ar