See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
10 cards from this deck
Vertices (points in a graph)
Route visiting each vertex exactly once
Visits all vertices once, returns to start
Eulerian: edges; Hamiltonian: vertices
No, only needs to visit all vertices
No simple test; use trial and error
Road trip visiting locations once, no return
Delivery routes returning to start point
A closed loop or circuit
Show more
Select your subjects, and get access to A+ resources today.