See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
10 cards from this deck
Chinese Postman Problem
Shortest closed path visiting every edge at least once
All vertices have even degrees
Always an even number
Minimises total weight of added paths
Make all vertices have even degrees
Sum of original edge weights + sum of added edge weights
Eulerian circuit
Check vertex degrees, identify odd vertices
Postal routes, garbage collection, street cleaning
Select your subjects, and get access to A+ resources today.