Graph

Connected Components / BFS/ DFS

1.Maximum number of edges to be removed to contain exactly K connected components in the Graph2. Social Networking Graph3.The Flight Plan6.Longest path in an undirected tree7.Keys and Rooms9.Number of Islands10. Number of Provinces11.Surrounded Regions12. All Paths From Source to Target13.Word Ladder14.Rotting Oranges19. 01 Matrix22.Word Search23. Minimum Time to Collect All Apples in a Tree24. Time Needed to Inform All Employees25. As Far from Land as Possible26. Clone Graph29. Number of Operations to Make Network Connected30. Open the Lock31. Word Search II33. Knight On Chess Board34. Shortest Bridge35. Pacific Atlantic Water Flow36. Making A Large Island

Cycle Detection

4.Is it a tree?15.Course Schedule

Bipartite Graphs

5.Possible Bipartition8.Is Graph Bipartite?

MST

27. Min Cost to Connect All Points

Directed Graph Indegree

17. Minimum Number of Vertices to Reach All Nodes

Shortest Distances

18.Network Delay Time20. Cheapest Flights Within K Stops28. Find the City With the Smallest Number of Neighbors at a Threshold Distance32. Number of Ways to Arrive at Destination37. Path with Maximum Probability

Strongly Connected Components

21. Critical Connections in a Network

Topological Sort

16.Course Schedule II

Graph Algorithms

Graph Algorithms