- Dijkstra's Shortest Path Algorithm; Check out Wiki
- Shortest Path within K Stops; See example LeetCode
- Breadth first search
- Shortest Path with Alternating Colors; See example LeetCode
- Breadth first search
- Count the Number of Complete Components; See example LeetCode
- Depth first search
- Min Cost to Connect All Points; See example LeetCode
- Kruskal’s algorithm and Union-Find algorithm
- Course Schedule; See example LeetCode
- Kahn's algorithm and Breadth first search
- Possible Bipartition; See example LeetCode
- Breadth first search