DFS

340+ posts

Similar Topics

DSA

20.6k+ articles

Mathematical

7.6k+ articles

Searching

1.6k+ articles

Competitive Programming

1.4k+ articles

1.3k+ articles

1.2k+ articles

1.2k+ articles

970+ articles

820+ articles

200+ articles

Top 10 algorithms in Interview Questions

Last updated: 20 February 2023

In this post "Top 10 coding problems of important topics with their solutions " are written. If you are preparing for a coding interview, going through these problems is ...read more

Interview Tips

interview-preparation

placement preparation

Iterative Depth First Traversal of Graph

Last updated: 29 December 2022

Depth First Traversal (or Search) for a graph is similar to Depth First Traversal (DFS) of a tree. The only catch here is, unlike trees, graphs may contain cycles, so a no...read more

Connected Components in an Undirected Graph

Last updated: 07 March 2023

Given an undirected graph, the task is to print all the connected components line by line.Examples:Input: Consider the following graph Output:0 1 23 4Explanation: There ar...read more

Print all paths from a given source to a destination

Last updated: 09 January 2023

Given a directed graph, a source vertex 's' and a destination vertex 'd', print all paths from given 's' to 'd'.Consider the following directed graph. Let the s be 2 and d...read more

Detect cycle in an undirected graph

Last updated: 25 July 2023

Given an undirected graph, The task is to check if there is a cycle in the given graph.Example:Input: N = 4, E = 4Output: YesExplanation:The diagram clearly shows a cycle ...read more

Strongly Connected Components

Last updated: 20 September 2023

A strongly connected component is the component of a directed graph that has a path from every vertex to every other vertex in that component. It can only be used in a dir...read more

Last updated: 01 June 2023

Topological sorting for Directed Acyclic Graph (DAG) is a linear ordering of vertices such that for every directed edge u v, vertex u comes before v in the ordering.Note: ...read more

Check whether a given graph is Bipartite or not

Last updated: 11 September 2023

A Bipartite Graph is a graph whose vertices can be divided into two independent sets, U and V such that every edge (u, v) either connects a vertex from U to V or a vertex ...read more

Find the number of islands using DFS

Last updated: 01 August 2023

Given a binary 2D matrix, find the number of islands. A group of connected 1s forms an island. For example, the below matrix contains 4 islands.Example:Input: mat[][] = {{...read more

Streamoid Technologies

Last updated: 24 February 2023

Hamiltonian cycle:The Hamiltonian cycle of undirected graph G = V , E is the cycle containing each vertex in V. -If graph contains a Hamiltonian cycle, it is called Ha ...read more

Detect Cycle in a Directed Graph

Last updated: 13 September 2023

Given the root of a Directed graph, The task is to check whether the graph contains a cycle or not.Examples:Input: N = 4, E = 6 Output: YesExplanation: The diagram clearly...read more

Depth First Search or DFS for a Graph

Last updated: 09 June 2023

Depth First Traversal (or DFS) for a graph is similar to Depth First Traversal of a tree. The only catch here is, that, unlike trees, graphs may contain cycles (a node may...read more

1 2 3 4 5 6 7 8 >>

1 2 3 4 5 6 >>

1 2 3 4 >>