13 docs tagged with "bfs"

A side-by-side comparison of Breadth-First Search (BFS) and Depth-First Search (DFS) graph traversal algorithms.

A complete guide to Breadth-First Search (BFS) algorithm with explanations, use cases, and implementations in Python, Java, C++, and JavaScript.

Learn how to implement Breadth-First Search (BFS) for graph traversal in Swift, with code examples and complexity analysis.

Solution for LeetCode 787: Cheapest Flights Within K Stops, utilizing BFS (Modified Dijkstra) to find the cheapest flight path within K stops.

The Edmonds-Karp algorithm is a flow network algorithm used to compute the maximum flow between a source and a sink in a flow network. It is an implementation of the Ford-Fulkerson method that uses breadth-first search (BFS) to find augmenting paths.

Solution for LeetCode 802: Find Eventual Safe States, utilizing Graph Traversal (DFS Cycle Detection) and BFS (Kahn's Algorithm).

Solution for LeetCode 733: Flood Fill, utilizing Graph Traversal (DFS).

Solution for LeetCode 200: Number of Islands, utilizing Graph Traversal (DFS) to count connected components in a matrix.

Solution for LeetCode 547: Number of Provinces, utilizing Graph Traversal (DFS) to find connected components.

Practice problems for Graphs to help you understand the concepts better.

Solve the Rotten Oranges problem using Breadth-First Search (BFS) to determine the minimum time required for all fresh oranges to rot.

Solution for LeetCode 130: Surrounded Regions, utilizing Graph Traversal (DFS) on the boundaries to capture enclosed components.

Solving the Vertical Order Traversal of a Binary Tree problem using Coordinate Mapping and Sorting.