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 every vertex exactly once and returning to start
Complete graph
Wt(A→C)≤Wt(A→B)+Wt(B→C)\text{Wt}(A \to C) \leq \text{Wt}(A \to B) + \text{Wt}(B \to C)Wt(A→C)≤Wt(A→B)+Wt(B→C)
Infinity (∞\infty∞)
Upper bound
Start at the initial vertex
Move to nearest unvisited vertex
Simple and fast
May not give optimal solution
Use shortcuts with shorter connections
Select your subjects, and get access to A+ resources today.