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 loops, multiple edges, or cycles
n−1n - 1n−1 edges
Tree that connects all vertices of a graph
Spanning tree with smallest possible total weight
Finds the minimum spanning tree of a graph
Any vertex (choice doesn't affect result)
Choose smallest edge that doesn't create a cycle
Sum of all weights on edges in the tree
Connector links all points; shortest links two specific points
Utilities, cables, pipelines, road networks
Show more
Select your subjects, and get access to A+ resources today.