See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
10 questions from this quiz
A subset of edges connecting all vertices with minimum weight and no cycles
No cycles
Optimising electrical grids
Grows from a single vertex
Adds smallest edges, ensuring no cycles
Adjacency matrices
Edge lists
O(v2)O(v^2)O(v2)
O(eloge)O(e \log e)O(eloge)
Explicitly using disjoint sets
Select your subjects, and get access to A+ resources today.