Graph Traversals

40+ posts

Similar Topics

20.6k+ articles

7.6k+ articles

1.6k+ articles

970+ articles

820+ articles

340+ articles

300+ articles

200+ articles

50+ articles

Algorithms-Graph Traversals

30+ articles

Minimum number of edges required to be removed from an Undirected Graph to make it acyclic

Last Updated: 21 June 2021

Given an undirected graph consisting of N nodes containing values from the range [1, N] and M edges in a matrix Edges[][], the task is to determine the minimum number of e...read more

Check if a given Graph is 2-edge connected or not

Last Updated: 27 February 2023

Given an undirected graph G, with V vertices and E edges, the task is to check whether the graph is 2-edge connected or not. A graph is said to be 2-edge connected if, on ...read more

Minimum time taken by each job to be completed given by a Directed Acyclic Graph

Last Updated: 06 February 2023

Given a Directed Acyclic Graph having V vertices and E edges, where each edge {U, V} represents the Jobs U and V such that Job V can only be started only after completion ...read more

Data Structures-Graph

Algorithms-Graph Traversals

Graph Traversals

DSA

Find number of closed islands in given Matrix

Last Updated: 11 April 2023

Given a binary matrix mat[][] of dimensions NxM such that 1 denotes the island and 0 denotes the water. The task is to find the number of closed islands in the given matri ...read more

Algorithms-Graph Traversals

Graph Traversals

disjoint-set

DSA

Detect cycle in Directed Graph using Topological Sort

Last Updated: 30 October 2022

Given a Directed Graph consisting of N vertices and M edges and a set of Edges[][], the task is to check whether the graph contains a cycle or not using Topological sort.T ...read more

Convert Adjacency List to Adjacency Matrix representation of a Graph

Last Updated: 30 June 2021

Given an adjacency list representation of a Graph, the task is to convert the given Adjacency List to Adjacency Matrix representation.Examples:Input: adjList[] = {{0 -- 1 ...read more

Minimum edges required to make a Directed Graph Strongly Connected

Last Updated: 23 October 2021

Given a Directed graph of N vertices and M edges, the task is to find the minimum number of edges required to make the given graph Strongly Connected.Examples:Input: N = 3 ...read more

Minimum Cost Path in a directed graph via given set of intermediate nodes

Last Updated: 05 March 2023

Given a weighted, directed graph G, an array V[] consisting of vertices, the task is to find the Minimum Cost Path passing through all the vertices of the set V, from a gi...read more

Print all shortest paths between given source and destination in an undirected graph

Last Updated: 09 February 2023

Given an undirected and unweighted graph and two nodes as source and destination, the task is to print all the paths of the shortest length between the given source and de...read more

Graph

Algorithms

Competitive Programming

Algorithms | Graph Traversals | Question 12

Last Updated: 15 November 2018

The Breadth First Search algorithm has been implemented using the queue data structure. One possible order of visiting the nodes of the following graph is ...read more

DSA Quiz

Algorithms-Graph Traversals

Graph Traversals

Algorithms | Graph Traversals | Question 2

Last Updated: 28 June 2021

Traversal of a graph is different from tree because (A)There can be a loop in graph so we must maintain a visited flag for every vertex(B)DFS of a g ...read more

DSA Quiz

Algorithms-Graph Traversals

Graph Traversals

Algorithms | Graph Traversals | Question 1

Last Updated: 28 June 2021

Which of the following algorithms can be used to most efficiently determine the presence of a cycle in a given graph ? (A)Depth First Search(B)Bread ...read more

DSA Quiz

Algorithms-Graph Traversals

1 2 3 4 >>

1 2 3 4 >>

1 2 3 4 >>