450 DSA Cracker
Topics (/) / Graph
Serial
No. Questions
1 Create a Graph, print it ([Link]
2 Implement BFS algorithm ([Link]
traversal-of-graph/1)
3 Implement DFS Algo ([Link]
for-a-graph/)
4 Detect Cycle in Directed Graph using BFS/DFS Algo
([Link]
5 Detect Cycle in UnDirected Graph using BFS/DFS Algo
([Link]
graph/1)
6 Search in a Maze ([Link]
problem/1)
7 Minimum Step by Knight ([Link]
knight/0)
8 flood fill algo ([Link]
9 Clone a graph ([Link]
10 Making wired Connections ([Link]
operations-to-make-network-connected/)
11 word Ladder ([Link]
12 Dijkstra algo ([Link]
greedy-algo-7/)
13 Implement Topological Sort
([Link]
Serial
No. Questions
14 Minimum time taken by each job to be completed given by a Directed Acyclic Graph
([Link]
completed-given-by-a-directed-acyclic-graph/)
15 Find whether it is possible to finish all tasks or not from given dependencies
([Link]
or-not-from-given-dependencies/)
16 Find the no. of Isalnds ([Link]
number-of-islands/1)
17 Given a sorted Dictionary of an Alien Language, find order of characters
([Link]
18 Implement Kruksal’sAlgorithm ([Link]
minimum-spanning-tree-algorithm-greedy-algo-2/)
19 Implement Prim’s Algorithm ([Link]
spanning-tree-mst-greedy-algo-5/)
20 Total no. of Spanning tree in a graph ([Link]
number-spanning-trees-graph/)
21 Implement Bellman Ford Algorithm
([Link]
22 Implement Floyd warshallAlgorithm
([Link]
23 Travelling Salesman Problem ([Link]
salesman-problem-set-1/)
24 Graph ColouringProblem ([Link]
applications/)
25 Snake and Ladders Problem ([Link]
ladders/)
26 Find bridge in a graph ([Link]
27 Count Strongly connected Components(Kosaraju Algo)
([Link]
kosarajus-algo/1)
28 Check whether a graph is Bipartite or Not
([Link]
29 Detect Negative cycle in a graph ([Link]
cycle-graph-bellman-ford/)
Serial
No. Questions
30 Longest path in a Directed Acyclic Graph ([Link]
longest-path-directed-acyclic-graph/)
31 Journey to the Moon ([Link]
moon/problem)
32 Cheapest Flights Within K Stops ([Link]
within-k-stops/description/)
33 Oliver and the Game
([Link]
sort/practice-problems/algorithm/oliver-and-the-game-3/)
34 Water Jug problem using BFS ([Link]
using-bfs/)
35 Water Jug problem using BFS ([Link]
using-bfs/)
36 Find if there is a path of more thank length from a source
([Link]
from-a-source/)
37 M-ColouringProblem ([Link]
problem/0)
38 Minimum edges to reverse o make path from source to destination
([Link]
destination/)
39 Paths to travel each nodes using each edge(Seven Bridges)
([Link]
konigsberg/)
40 Vertex Cover Problem ([Link]
1-introduction-approximate-algorithm-2/)
41 Chinese Postman or Route Inspection ([Link]
postman-route-inspection-set-1-introduction/)
42 Number of Triangles in a Directed and Undirected Graph
([Link]
undirected-graphs/)
43 Minimise the cashflow among a given set of friends who have borrowed money from
each other ([Link]
set-friends-borrowed-money/)
44 Two Clique Problem ([Link]
graph-can-divided-two-cliques/)