# Graph II

- [Bipartite](/cracking-leetcode/dfs-and-bfs/graph-ii/bipartite.md)
- [785. Is Graph Bipartite?](/cracking-leetcode/dfs-and-bfs/graph-ii/785.-is-graph-bipartite.md)
- [886. Possible Bipartition](/cracking-leetcode/dfs-and-bfs/graph-ii/886.-possible-bipartition.md)
- [1820. Maximum Number of Accepted Invitations (Maximum Bipartite Matching)](/cracking-leetcode/dfs-and-bfs/graph-ii/1820.-maximum-number-of-accepted-invitations-maximum-bipartite-matching.md)
- [MST - Prim's Algo](/cracking-leetcode/dfs-and-bfs/graph-ii/mst-prims-algo.md)
- [1135. Connecting Cities With Minimum Cost](/cracking-leetcode/dfs-and-bfs/graph-ii/mst-prims-algo/1135.-connecting-cities-with-minimum-cost.md)
- [1584. Min Cost to Connect All Points](/cracking-leetcode/dfs-and-bfs/graph-ii/mst-prims-algo/1584.-min-cost-to-connect-all-points.md)
- [MST - Kruskal's Algo](/cracking-leetcode/dfs-and-bfs/graph-ii/mst-kruskals-algo.md)
- [1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree](/cracking-leetcode/dfs-and-bfs/graph-ii/mst-kruskals-algo/1489.-find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.md)
- [1584. Min Cost to Connect All Points](/cracking-leetcode/dfs-and-bfs/graph-ii/mst-kruskals-algo/1584.-min-cost-to-connect-all-points.md): basically use union find
- [Floyd Algorithm](/cracking-leetcode/dfs-and-bfs/graph-ii/floyd-algorithm.md)
- [1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance](/cracking-leetcode/dfs-and-bfs/graph-ii/floyd-algorithm/1334.-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance.md)
