Graph New – 1

InterviewBit Graph Basic. GFG DFS - GFG Code In DFS, we start from a vertex, we first print it and then recursively call DFS for its adjacent vertices.  We need to take care of the scenario where the graph is not connected. Iterative Depth First Traversal of Graph - GFG. The logic here is to use… Continue reading Graph New – 1


Graph Problem Set

Problem Set - Video Lecture - Graph Representation part 01 - Edge List Graph Representation part 02 - Adjacency Matrix Graph Representation part 03 - Adjacency List Important Problem Set - 1. Breadth First Search (BFS) 2. Depth First Search (DFS) 3. Shortest Path from source to all vertices **Dijkstra** 4. Shortest Path from… Continue reading Graph Problem Set