| Iterative Depth First Traversal of Graph | In iterative depth first traversal of graph problem, we have given a graph data structure. Write read more |
| Max Area of Island | Problem Description: Given a 2D matrix, the matrix has only 0(representing water) and read more |
| Graph Cloning | What is Graph Cloning? Today we have with us a reference to an undirected graph. What do we have to read more |
| Kruskal Algorithm | What is Kruskal Algorithm? Kruskal’s algorithm is used to find the minimum spanning tree(MST) read more |
| Floyd Warshall Algorithm | Floyd Warshall Algorithm is a method to find the shortest path between two vertices for all the read more |
| Bipartite Graph | A bipartite graph is a type of graph in which we divide the vertices of a graph into two sets. read more |
| Strongly Connected Component | Strongly Connected Components are the connected components of a given graph. SCC(strongly connected read more |
| Applications of Breadth First Search and Depth First Search | In the previous post(Graph and its implementation, BFS of a graph and DFS of a graph) we understand read more |
| BFS vs DFS for Binary Tree | Breadth First Search (BFS) Do we already know about what actually BFS is? if not then don’t read more |
| Depth First Search (DFS) for a Graph | Depth First Search is a traversing or searching algorithm in tree/graph data structure. The read more |
| Breadth First Search (BFS) for a Graph | Breadth First Search (BFS) for a graph is a traversing or searching algorithm in tree/graph data read more |
| Graph and its representation | A graph is an abstract data type representing relations or connections between objects(like cities read more |
