Graph
Connected Components / BFS/ DFS
page1.Maximum number of edges to be removed to contain exactly K connected components in the Graphpage2. Social Networking Graphpage3.The Flight Planpage6.Longest path in an undirected treepage7.Keys and Roomspage9.Number of Islandspage10. Number of Provincespage11.Surrounded Regionspage12. All Paths From Source to Targetpage13.Word Ladderpage14.Rotting Orangespage19. 01 Matrixpage22.Word Searchpage23. Minimum Time to Collect All Apples in a Treepage24. Time Needed to Inform All Employeespage25. As Far from Land as Possiblepage26. Clone Graphpage29. Number of Operations to Make Network Connectedpage30. Open the Lockpage31. Word Search IIpage33. Knight On Chess Boardpage34. Shortest Bridgepage35. Pacific Atlantic Water Flowpage36. Making A Large IslandCycle Detection
page4.Is it a tree?page15.Course ScheduleBipartite Graphs
page5.Possible Bipartitionpage8.Is Graph Bipartite?MST
page27. Min Cost to Connect All PointsDirected Graph Indegree
page17. Minimum Number of Vertices to Reach All NodesShortest Distances
page18.Network Delay Timepage20. Cheapest Flights Within K Stopspage28. Find the City With the Smallest Number of Neighbors at a Threshold Distancepage32. Number of Ways to Arrive at Destinationpage37. Path with Maximum ProbabilityStrongly Connected Components
page21. Critical Connections in a NetworkTopological Sort
page16.Course Schedule IIGraph Algorithms
pageGraph AlgorithmsPrevious6. Complement of Base 10 IntegerNext1.Maximum number of edges to be removed to contain exactly K connected components in the Graph
Last updated