See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
10 cards from this deck
Shortest route visiting all vertices & returning to start
Closed path visiting each vertex exactly once, then returns
Minimum weight Hamiltonian cycle
12(n−1)!\frac{1}{2}(n-1)!21(n−1)!
Finds good solution that may not be optimal
Minimum weight arc to unvisited vertex
Repeat from each vertex, select best tour
Length of that tour
Two smallest arcs from VVV + MST of rest
Smallest upper bound, largest lower bound
Select your subjects, and get access to A+ resources today.