BFS

Everything about BFS

1. Article · Java

   Minimum Time to Finish Project with Dependencies Using Topological Sort in Java

   Learn how to calculate the minimum project completion time in Java using topological sorting, Kahn's algorithm, and dynamic programming to handle dependencies and detect cycles.

   Sandhiya PriyaOct 12,5801,000
2. Article · Data Structures and Algorithms (DSA)

   Shortest Path in 1-2 Graph – Complete Explanation (Java)

   Find the shortest path in a 1-2 weighted graph efficiently using BFS after transforming weight-2 edges.

   Sandhiya PriyaJul 283,1611,000
   
3. Article · Data Structures and Algorithms (DSA)

   Rotten Oranges Problem

   Solve the Rotten Oranges problem using multi-source BFS! Find the minimum time to rot all fresh oranges in a grid. Learn the BFS approach with Java code and complexity analysis.

   Sandhiya PriyaMay 14121,000
4. Article · Data Structures and Algorithms (DSA)

   BFS and DFS in Graph with Example

   Master BFS and DFS graph traversal algorithms! Explore level-by-level (BFS) and depth-first (DFS) approaches with examples, code, and comparisons. Essential for DSA!

   Nidhi SharmaJan 163,7631,000
5. Article · Data Structures and Algorithms (DSA)

   What is Graph Algorithms: BFS, DFS, and Shortest Path with Examples

   Explore graph algorithms like BFS, DFS, and Dijkstra's for efficient problem-solving. Learn how BFS finds shortest paths in unweighted graphs, DFS excels in cycle detection, and Dijkstra's optimizes routes in weighted graphs. Discover real-world applications in navigation, social networks, and AI, mastering essential tools for connectivity, optimization, and exploration in computer science. These algorithms are crucial for developers tackling complex challenges.

   Baibhav KumarOct 12, 20253,6831,000
6. 
   Article · Algorithms in C#

   What Algorithm Finds the Shortest Path in a Grid with Obstacles?

   Explore algorithms for finding the shortest path in grids with obstacles, crucial for AI, robotics, and game development. Learn about BFS, A*, Dijkstra's, and Greedy Best-First Search, understanding their strengths, weaknesses, and real-world applications like GPS navigation and robotics. Discover which algorithm suits your specific needs for efficient pathfinding.

   Saurav KumarOct 1, 20255,4221,000
7. 
   Article · Algorithms in C#

   BFS for Disconnected Graph

   This code implements breadth-first search (BFS) for disconnected graphs. It uses an adjacency list to represent the graph and provides methods for adding edges and performing BFS traversal. The constructor initializes the graph, the AddEdge method connects vertices, and the Bfs method traverses the graph in breadth-first order. The time complexity is O(V+E). An example demonstrates usage.

   Rajiv SinghAug 22, 20233,2231,000
8. 
   Article · Algorithms in C#

   Breadth First Search for a Graph

   Learn how to implement BFS with a C# class, BfsGraph, showcasing its core components. Understand the role of adjacency lists and vertices within the class and the functionalities of the constructor and AddEdge method.

   Rajiv SinghAug 16, 202310,8841,000