See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
10 cards from this deck
Connected graph with no cycles, multiple edges, or loops
n−1n-1n−1 edges
A tree that connects all vertices of a graph
Spanning tree with minimum total edge weight
Finds minimum spanning tree in a weighted graph
Chooses smallest weight edge that doesn't create a cycle
Any vertex (choice doesn't matter)
Add up all edge weights in the tree
There is a path between any two vertices
Kruskal's algorithm
Select your subjects, and get access to A+ resources today.