See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
13 cards from this deck
Connects all vertices w/ smallest total edge weight
n−1n-1n−1 edges
Contains no cycles
Considers edges in ascending weight order, avoids cycles
List all edges in ascending order of weight
Greedy algorithms
Grows tree from starting vertex, adds cheapest edge to new vertex
Can start from any vertex
Global - considers all edges at once
Local - grows from one starting point
When all edge weights are distinct
Skip if both vertices already connected
Sparse graphs (few edges)
Select your subjects, and get access to A+ resources today.