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, no cycles, loops, or multiple edges
n−1n - 1n−1 edges
Tree connecting all vertices of a graph
Spanning tree with minimum total edge weight
Find minimum spanning tree in weighted graph
Choose any starting vertex
Lowest weight edge that doesn't create a cycle
All vertices included in tree
Path exists between any two vertices
Cannot return to vertex by following edges
Select your subjects, and get access to A+ resources today.