Back to Topics
Graph
Your Progress
Progress
0%
Total Problems
44
Completed
0
Status | Problem | Bookmark | Notes | Actions |
---|---|---|---|---|
Create a Graph, print it (implemented code) | ||||
Create a Graph (for practice) | ||||
Implement BFS algorithm | ||||
Implement DFS Algo | ||||
Detect Cycle in Directed Graph using BFS/DFS Algo | ||||
Detect Cycle in UnDirected Graph using BFS/DFS Algo | ||||
Search in a Maze | ||||
Minimum Step by Knight | ||||
flood fill algo | ||||
Clone a graph | ||||
Making wired Connections | ||||
word Ladder | ||||
Dijkstra algo | ||||
Implement Topological Sort | ||||
Minimum time taken by each job to be completed given by a Directed Acyclic Graph | ||||
Find whether it is possible to finish all tasks or not from given dependencies | ||||
Find the no. of Islands | ||||
Given a sorted Dictionary of an Alien Language, find order of characters | ||||
Implement Kruksal’sAlgorithm | ||||
Implement Prim’s Algorithm | ||||
Total no. of Spanning tree in a graph | ||||
Implement Bellman Ford Algorithm | ||||
Implement Floyd warshallAlgorithm | ||||
Travelling Salesman Problem | ||||
Graph ColouringProblem | ||||
Snake and Ladders Problem | ||||
Find bridge in a graph | ||||
Count Strongly connected Components(Kosaraju Algo) | ||||
Check whether a graph is Bipartite or Not | ||||
Detect Negative cycle in a graph | ||||
Longest path in a Directed Acyclic Graph | ||||
Journey to the Moon | ||||
Cheapest Flights Within K Stops | ||||
Oliver and the Game | ||||
Water Jug problem using BFS | ||||
Find if there is a path of more thank length from a source | ||||
M-ColouringProblem | ||||
Minimum edges to reverse o make path from source to destination | ||||
Paths to travel each nodes using each edge(Seven Bridges) | ||||
Vertex Cover Problem | ||||
Chinese Postman or Route Inspection | ||||
Number of Triangles in a Directed and Undirected Graph | ||||
Minimise the cashflow among a given set of friends who have borrowed money from each other | ||||
Two Clique Problem |