Every tree is a graph, but not every graph is tree. Because graphs have so much more optionality with their edges, graphs can get extremely complicated. Make sure that you master this critical data structures and its accompanying algorithms, particularly with traversal.
If you need additional support taking those skills and actually applying them, take Alvin's *complete* data structures and algorithms course on [**Structy**](https://structy.net/?utm_source=taro). You can try out the concepts yourself in their interactive code editor and learn advanced DSA patterns like stack exhaustive recursion.
Use [**this link to get 20% off**](https://structy.net/purchase?promo_code=taro20) the entire Structy DSA learning experience (discount code **TARO20**).
Overview
Syllabus
- Overview
- Graph Intro Lecture
- Graph Warm Up Lecture
- Core Problems
- Has Path Approach
- Has Path Walkthrough
- Undirected Path Approach
- Undirected Path Walkthrough
- Connected Components Count Approach
- Connected Components Count Walkthrough
- Largest Component Approach
- Largest Component Walkthrough
- Shortest Path Approach
- Shortest Path Walkthrough
- Island Count Approach
- Island Count Walkthrough
- Minimum Island Approach
- Minimum Island Walkthrough
- Wrapping Up
- Outro
Taught by
Alvin Zablan