Algorithms-Graph Traversals

Stack

Algorithms

Advanced Data Structure

Technical Scripter

DFS

graph-connectivity

Technical Scripter 2020

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

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

Minimum Cost using Dijkstra by Modifying Cost of an Edge

Similar Topics

20.6k+ articles

2k+ articles

1.2k+ articles

970+ articles

820+ articles

340+ articles

300+ articles

200+ articles

40+ articles

Data Structures-Graph

20+ articles

Last updated: 27 March 2023

Given an undirected weighted graph of N nodes and M edges in the form of a tuple lets say {X, Y, Z} such that there is an edge with cost Z between X and Y. We are supposed...read more

Data Structures-Graph

priority-queue

cpp-priority-queue

Maximum cost path in an Undirected Graph such that no edge is visited twice in a row

Last updated: 24 November 2021

Given an undirected graph having N vertices and M edges and each vertex is associated with a cost and a source vertex S is given. The task is to find the maximum cost path...read more

Check if a directed graph is connected or not

Last updated: 13 March 2022

Given a directed graph. The task is to check if the given graph is connected or not.Examples:Input:Output: YesInput:Output: NoApproach:Take two bool arrays vis1 and vis2 o...read more

DFS

In graph theory, edge coloring of a graph is an assignment of "colors" to the edges of the graph so that no two adjacent edges have the same color with an optimal number o...read more

Edge Coloring of a Graph

Last updated: 15 March 2023

Algorithms

BFS

Graph Coloring

Largest connected component on a grid

Last updated: 16 March 2023

Given a grid with different colors in a different cell, each color represented by a different number. The task is to find out the largest connected component on the grid. ...read more

Pattern Searching

Matrix

Competitive Programming

BFS

Paths to travel each nodes using each edge (Seven Bridges of Königsberg)

Last updated: 11 March 2023

There are n nodes and m bridges in between these nodes. Print the possible path through each node using each edges (if possible), traveling through each edges only once.Ex...read more

Algorithms | Graph Traversals | Question 9

Last updated: 28 June 2021

Which of the following condition is sufficient to detect cycle in a directed graph? (A)There is an edge from currently being visited node to an alre ...read more

Algorithms | Graph Traversals | Question 8

Last updated: 28 June 2021

Given two vertices in a graph s and t, which of the two traversals (BFS and DFS) can be used to find if there is path from s to t? (A)Only BFS(B)Onl ...read more

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

Algorithms | Graph Traversals | Question 12

Last updated: 28 June 2021

What are the appropriate data structures for following algorithms?1) Breadth-First Search 2) Depth First Search 3) Prim\'s Minimum Span ...read more

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

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