Before reading this guide, you may find it helpful to read the guide on graphs from Module 7 (M7) and the guide on indices from Module 8 (M8). In Module 7 (M7) Graphs, you learned that ...

It also called to mind a “Eulerian graph” in mathematics, which involves a trail that traverses every edge exactly once while starting and ending at the same point. If you're enjoying this ...