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 subgraph, all vertices, min weight, no cycles, n−1n-1n−1 edges
n−1n-1n−1 edges
Greedy algorithm
Makes locally optimal choice, picks smallest weight arc available
Only considers arcs from connected to unconnected vertices
Select any vertex
Cross out row, number column
Minimum undeleted weight in numbered columns
Choose any at random; same total weight, different valid MSTs
Prim's grows one tree; Kruskal's builds multiple fragments
Select your subjects, and get access to A+ resources today.