Each dot is a vertex, each line is an edge. The number on a vertex\'s shoulder = its degree (green = even, red = odd). Traversing every edge \"in one stroke\" (an Eulerian path) is only possible with 0 or 2 odd-degree vertices.
—
Click a vertex to see its degree · pick a scenario on the right to run an algorithm
Your browser has canvas disabled.
|V| · |E| · odd-degree vertex count over time|E||V|odd vertices