Skip to content

ambuj2000/Graph-Algorithms-and-Problems

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

94 Commits
Alien Dictionary using topo sort.cpp
Alien Dictionary using topo sort.cpp
 
 
BFS algorithm.cpp
BFS algorithm.cpp
 
 
Bellman-ford algorithm(distance from src).cpp
Bellman-ford algorithm(distance from src).cpp
 
 
Bipartite graph using BFS.cpp
Bipartite graph using BFS.cpp
 
 
Bipartite graph using DFS.cpp
Bipartite graph using DFS.cpp
 
 
Cheapest flights within K stops.cpp
Cheapest flights within K stops.cpp
 
 
Course Schedule.cpp
Course Schedule.cpp
 
 
DFS algorithm.cpp
DFS algorithm.cpp
 
 
DSU by rank.cpp
DSU by rank.cpp
 
 
DSU by size.cpp
DSU by size.cpp
 
 
Detect a cycle in directed graph using Topo sort.cpp
Detect a cycle in directed graph using Topo sort.cpp
 
 
Detect cycle in directed graph using DFS.cpp
Detect cycle in directed graph using DFS.cpp
 
 
Detect cycle in undirected graph using DFS.cpp
Detect cycle in undirected graph using DFS.cpp
 
 
Detectcycle in undirected graph using BFS.cpp
Detectcycle in undirected graph using BFS.cpp
 
 
Detonate Maximum Bombs using DFS & BFS.cpp
Detonate Maximum Bombs using DFS & BFS.cpp
 
 
Dijkstra's algo using Set.cpp
Dijkstra's algo using Set.cpp
 
 
Dijkstra's algo using priority queue.cpp
Dijkstra's algo using priority queue.cpp
 
 
Distance of Nearest cell having 1.cpp
Distance of Nearest cell having 1.cpp
 
 
Eventual Safe States using DFS .cpp
Eventual Safe States using DFS .cpp
 
 
Eventual safe states using topo sort.cpp
Eventual safe states using topo sort.cpp
 
 
Find the City With the Smallest Number of Neighbours at a Threshold Distance using Dijkstra's algo.cpp
Find the City With the Smallest Number of Neighbours at a Threshold Distance using Dijkstra's algo.cpp
 
 
Flood Fill algorithm.cpp
Flood Fill algorithm.cpp
 
 
Floyd Warshall.cpp
Floyd Warshall.cpp
 
 
Important Nodes using bfs.cpp
Important Nodes using bfs.cpp
 
 
Krushkal's algo for MST.cpp
Krushkal's algo for MST.cpp
 
 
Minimum multiplication to reach end.cpp
Minimum multiplication to reach end.cpp
 
 
Number Of Enclaves using BFS.cpp
Number Of Enclaves using BFS.cpp
 
 
Number of Distinct Islands.cpp
Number of Distinct Islands.cpp
 
 
Number of Islands using DFS.cpp
Number of Islands using DFS.cpp
 
 
Number of Provinces (Graph) using DFS .cpp
Number of Provinces (Graph) using DFS .cpp
 
 
Number of ways to arrive at Destination.cpp
Number of ways to arrive at Destination.cpp
 
 
Path with minimum effort using bfs.cpp
Path with minimum effort using bfs.cpp
 
 
Prerequisite Tasks.cpp
Prerequisite Tasks.cpp
 
 
Prims algorithm for MST.cpp
Prims algorithm for MST.cpp
 
 
Print shortest path using Dijkstra's algo.cpp
Print shortest path using Dijkstra's algo.cpp
 
 
README.md
README.md
 
 
Regions Cut by Slashes [DSU] leetcode.cpp
Regions Cut by Slashes [DSU] leetcode.cpp
 
 
Rotten Oranges(Multi-source BFS).cpp
Rotten Oranges(Multi-source BFS).cpp
 
 
Shortest Distance in a binary maze using BFS.cpp
Shortest Distance in a binary maze using BFS.cpp
 
 
Shortest path in DAG using topo sort(DFS).cpp
Shortest path in DAG using topo sort(DFS).cpp
 
 
Shortest path in Undirected Graph having unit distance using BFS.cpp
Shortest path in Undirected Graph having unit distance using BFS.cpp
 
 
Surrounded Regions using DFS.cpp
Surrounded Regions using DFS.cpp
 
 
Topological sort (Kahn's algo) using BFS.cpp
Topological sort (Kahn's algo) using BFS.cpp
 
 
Topological sort.cpp
Topological sort.cpp
 
 
Water Supply using dfs.cpp
Water Supply using dfs.cpp
 
 
Word Ladder I using BFS.cpp
Word Ladder I using BFS.cpp
 
 
Word Ladder II.cpp
Word Ladder II.cpp
 
 

Repository files navigation

So my point was that dfs is much more useful. Bfs has limitations in sense that everytime you cannot apply it But dfs has randomness due to which you can use it at most of the places. It also helps you to improve dp/ recursion type of concepts. What i will recommend is that solve some problems and in all cases try to give priority to dfs you will understand its beauty!!

Depth-First Search (DFS) is not typically used to find the shortest path in a graph. It explores as far as possible along each branch before backtracking. While it can be adapted to find paths between nodes, it doesn't guarantee finding the shortest path. Instead, it's more commonly used to explore all nodes reachable from the starting point.

For finding the shortest path, algorithms like Breadth-First Search (BFS) or Dijkstra's algorithm are more appropriate. BFS explores all the neighbors of a node before moving on to the next level, ensuring that the shortest path to each node is found first. Dijkstra's algorithm, on the other hand, iteratively selects the node with the smallest tentative distance from the start node until the destination is reached.

So, while DFS can be used to find paths, it's not the best choice for finding the shortest path in a graph.

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages