Library/Graph - DSA

Published

Start Reading Chapter 1

TechnologyData Structures & AlgorithmsYouTube Playlist CourseBeginner

11 hrs 27 mins

56 Chapters

Graph - DSA

By take U forward

Master graph data structures and algorithms with comprehensive problem-solving techniques in C++ and Java. Designed for technical interviews, this guide covers essential traversals, cycle detection, and matrix-based graph challenges to build rock-solid coding logic.

Table of Contents

Graph - DSA

Table of Contents

G-1. Introduction to Graph | Types | Different Conventions Used

G-2. Graph Representation in C++ | Two Ways to Represent

G-3. Graph Representation in Java | Two Ways to Represent

G-4. What are Connected Components ?

G-5. Breadth-First Search (BFS) | C++ and Java | Traversal Technique in Graphs

G-6. Depth-First Search (DFS) | C++ and Java | Traversal Technique in Graphs

G-7. Number of Provinces | C++ | Java | Connected Components

G-8. Number of Islands | Number of Connected Components in Matrix | C++ | Java

G-9. Flood Fill Algorithm | C++ | Java

G-10. Rotten Oranges | C++ | Java

G-11. Detect a Cycle in an Undirected Graph using BFS | C++ | Java

G-12. Detect a Cycle in an Undirected Graph using DFS | C++ | Java

G-13. Distance of nearest cell having 1 | 0/1 Matrix | C++ | Java

G-14. Surrounded Regions | Replace O's with X's | C++ | Java

G-15. Number of Enclaves | Multi-source BFS | C++ | Java

G-16. Number of Distinct Islands | Constructive Thinking + DFS | C++ | Java

G-17. Bipartite Graph | BFS | C++ | Java

G-18. Bipartite Graph | DFS | C++ | Java

G-19. Detect cycle in a directed graph using DFS | Java | C++

G-20. Find Eventual Safe States - DFS

G-21. Topological Sort Algorithm | DFS

G-22. Kahn's Algorithm | Topological Sort Algorithm | BFS

G-23. Detect a Cycle in Directed Graph | Topological Sort | Kahn's Algorithm | BFS

G-24. Course Schedule I and II | Pre-requisite Tasks | Topological Sort

G-25. Find Eventual Safe States - BFS - Topological Sort

G-26. Alien Dictionary - Topological Sort

G-27. Shortest Path in Directed Acyclic Graph - Topological Sort

G-28. Shortest Path in Undirected Graph with Unit Weights

G-29. Word Ladder - I | Shortest Paths

G-30. Word Ladder - 2 | Shortest Paths

G-31. Word Ladder - 2 | Optimised Approach for Leetcode

G-32. Dijkstra's Algorithm - Using Priority Queue - C++ and Java - Part 1

G-33. Dijkstra's Algorithm - Using Set - Part 2

G-34. Dijkstra's Algorithm - Why PQ and not Q, Intuition, Time Complexity Derivation - Part 3

G-35. Print Shortest Path - Dijkstra's Algorithm

G-36. Shortest Distance in a Binary Maze

G-37. Path With Minimum Effort

G-38. Cheapest Flights Within K Stops

G-39. Minimum Multiplications to Reach End

G-40. Number of Ways to Arrive at Destination

G-41. Bellman Ford Algorithm

G-42. Floyd Warshall Algorithm

G-43. Find the City With the Smallest Number of Neighbours at a Threshold Distance

G-44. Minimum Spanning Tree - Theory

G-45. Prim's Algorithm - Minimum Spanning Tree - C++ and Java

G-46. Disjoint Set | Union by Rank | Union by Size | Path Compression

G-47. Kruskal's Algorithm - Minimum Spanning Tree - C++ and Java

G-48. Number of Provinces - Disjoint Set

G-49. Number of Operations to Make Network Connected - DSU

G-50. Accounts Merge - DSU

G-51. Number of Islands - II - Online Queries - DSU

G-52. Making a Large Island - DSU

G-53. Most Stones Removed with Same Row or Column - DSU

G-54. Strongly Connected Components - Kosaraju's Algorithm

G-55. Bridges in Graph - Using Tarjan's Algorithm of time in and low time

G-56. Articulation Point in Graph