Graph Algorithms

Graph algorithms are used to solve problems related to networks, paths, and connectivity. They include traversal, shortest path, and spanning tree algorithms.

Applications

• BFS and DFS
• Shortest path (Dijkstra, Bellman-Ford)
• Minimum spanning tree (Kruskal, Prim)

Practice Problems

200. Number of Islands

Solution | Approach

785. Is Graph Bipartite?

Solution | Approach