Getting everything ready for you…

Loading courses, problems and your progress. This takes just a moment.

0s

Courses › DSA

Graph Series

By take U forward · English · Intermediate

BFS, DFS, shortest paths, MST, DSU and interview problems on graphs.

A free YouTube playlist, organised on Codify: your progress is saved, you can take timestamped notes and practise in the code editor under every video. All videos belong to their creator.

What this course covers (56 videos)

  1. G-1. Introduction to Graph | Types | Different Conventions Used (13:43)
  2. G-2. Graph Representation in C++ | Two Ways to Represent (16:04)
  3. G-3. Graph Representation in Java | Two Ways to Represent (13:13)
  4. G-4. What are Connected Components ? (7:07)
  5. G-5. Breadth-First Search (BFS) | C++ and Java | Traversal Technique in Graphs (19:39)
  6. G-6. Depth-First Search (DFS) | C++ and Java | Traversal Technique in Graphs (20:16)
  7. G-7. Number of Provinces | C++ | Java | Connected Components (15:29)
  8. G-8. Number of Islands | Number of Connected Components in Matrix | C++ | Java (25:04)
  9. G-9. Flood Fill Algorithm | C++ | Java (20:34)
  10. G-10. Rotten Oranges | C++ | Java (22:30)
  11. G-11. Detect a Cycle in an Undirected Graph using BFS | C++ | Java (20:19)
  12. G-12. Detect a Cycle in an Undirected Graph using DFS | C++ | Java (19:10)
  13. G-13. Distance of nearest cell having 1 | 0/1 Matrix | C++ | Java (20:21)
  14. G-14. Surrounded Regions | Replace O's with X's | C++ | Java (23:17)
  15. G-15. Number of Enclaves | Multi-source BFS | C++ | Java (15:34)
  16. G-16. Number of Distinct Islands | Constructive Thinking + DFS | C++ | Java (18:02)
  17. G-17. Bipartite Graph | BFS | C++ | Java (18:29)
  18. G-18. Bipartite Graph | DFS | C++ | Java (14:54)
  19. G-19. Detect cycle in a directed graph using DFS | Java | C++ (17:22)
  20. G-20. Find Eventual Safe States - DFS (23:43)
  21. G-21. Topological Sort Algorithm | DFS (13:30)
  22. G-22. Kahn's Algorithm | Topological Sort Algorithm | BFS (13:50)
  23. G-23. Detect a Cycle in Directed Graph | Topological Sort | Kahn's Algorithm | BFS (6:17)
  24. G-24. Course Schedule I and II | Pre-requisite Tasks | Topological Sort (11:32)
  25. G-25. Find Eventual Safe States - BFS - Topological Sort (16:57)
  26. G-26. Alien Dictionary - Topological Sort (20:54)
  27. G-27. Shortest Path in Directed Acyclic Graph - Topological Sort (26:36)
  28. G-28. Shortest Path in Undirected Graph with Unit Weights (16:32)
  29. G-29. Word Ladder - I | Shortest Paths (28:07)
  30. G-30. Word Ladder - 2 | Shortest Paths (25:42)
  31. G-31. Word Ladder - 2 | Optimised Approach for Leetcode (23:40)
  32. G-32. Dijkstra's Algorithm - Using Priority Queue - C++ and Java - Part 1 (22:42)
  33. G-33. Dijkstra's Algorithm - Using Set - Part 2 (12:29)
  34. G-34. Dijkstra's Algorithm - Why PQ and not Q, Intuition, Time Complexity Derivation - Part 3 (14:30)
  35. G-35. Print Shortest Path - Dijkstra's Algorithm (19:20)
  36. G-36. Shortest Distance in a Binary Maze (23:42)
  37. G-37. Path With Minimum Effort (24:30)
  38. G-38. Cheapest Flights Within K Stops (23:56)
  39. G-39. Minimum Multiplications to Reach End (19:31)
  40. G-40. Number of Ways to Arrive at Destination (24:06)
  41. G-41. Bellman Ford Algorithm (27:43)
  42. G-42. Floyd Warshall Algorithm (30:13)
  43. G-43. Find the City With the Smallest Number of Neighbours at a Threshold Distance (12:56)
  44. G-44. Minimum Spanning Tree - Theory (7:59)
  45. G-45. Prim's Algorithm - Minimum Spanning Tree - C++ and Java (19:10)
  46. G-46. Disjoint Set | Union by Rank | Union by Size | Path Compression (42:15)
  47. G-47. Kruskal's Algorithm - Minimum Spanning Tree - C++ and Java (13:11)
  48. G-48. Number of Provinces - Disjoint Set (8:03)
  49. G-49. Number of Operations to Make Network Connected - DSU (14:48)
  50. G-50. Accounts Merge - DSU (22:01)
  51. G-51. Number of Islands - II - Online Queries - DSU (25:32)
  52. G-52. Making a Large Island - DSU (26:16)
  53. G-53. Most Stones Removed with Same Row or Column - DSU (23:51)
  54. G-54. Strongly Connected Components - Kosaraju's Algorithm (22:44)
  55. G-55. Bridges in Graph - Using Tarjan's Algorithm of time in and low time (23:25)
  56. G-56. Articulation Point in Graph (22:00)

More DSA courses