See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
10 cards from this deck
Sub-graph connecting all vertices without cycles
(n−1)(n-1)(n−1) edges
Spanning tree with lowest total weight
Greedy algorithm
Select edge with smallest weight
Check if it creates a cycle
When all vertices are connected
nn−2n^{n-2}nn−2
Connector
Minimum connector
Select your subjects, and get access to A+ resources today.