General · Networks · manipulative

Visit every vertex once?

Hamiltonian routes care about vertices (visit each once). Eulerian routes care about edges (trace each once) — a different question.

Click a vertex to start your route

Example graphs

Pick a graph, then click vertices to build a route.

Eulerian = every edge once · Hamiltonian = every vertex once

Your route

Your route is…

Working