Takeaways

• A weighted graph is a graph where each edge has a weight/cost. The meaning of the weight depends on the application.
• A minimum spanning tree is a set of connected edges from a graph that touches every vertex ("spans") with a minimum sum of edge weights
• Kruskal's algorithm iteratively selects the smallest edge that does not create a cycle
• Kruskals Algorithm runs in O(E log E) time.
• Prim's Algorithm is another method for finding the MST

Code

• March 25th Code