More Graph Theory

Excellent 2-Hour Course on Graphs on YouTube

If you are willing to dedicate time to learn graph theory in detail, it will help you immensely in your coding journey. The following free course is highly recommended.

Minimum Spanning Trees (MST): Kruskal and Prim's Algorithms

MSTs are typically overrepresented on coding competitions. Thus, it is important for you to know at least one (preferably both) algorithm(s) for constructing them. The videos and review materials for this topic can be found on the Data Structures website under the Graphs Unit. After studying these materials and becoming familiar with MSTs and Disjoint Sets, try to solve the following problems on LeetCode:

1. Min-Cost-to-Connect-All-Points (Medium)

2. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree (Optional - Hard)