A path that traces every edge exactly once is called an Eulerian path.
From “Can you solve the Ragnarok riddle? - Dan Finkel” — TED-Ed
see it said at 2:17Surprising facts — each proven at the exact second of its video
A path that traces every edge exactly once is called an Eulerian path.
From “Can you solve the Ragnarok riddle? - Dan Finkel” — TED-Ed
see it said at 2:17