Breadth First Search (BFS) Algorithm
The Lee Algorithm is a breadth-first search (BFS) algorithm that is used to find the shortest path between two points in a grid-like structure, such as a maze. It is an unweighted grid-based algorithm, meaning that all cells in the grid have the same traversal cost, and it finds the shortest path …
Bellman-Ford Algorithm
The Bellman-Ford algorithm is a dynamic programming algorithm that computes the shortest paths from a single source vertex to all other vertices in a weighted graph. It is particularly useful for graphs that contain negative weight edges, which Dijkstra’s algorithm cannot handle. Key Characteristics…
Disjoint Set Union (DSU)
Union-Find, also known as the Disjoint Set Union (DSU), is a data structure that is used to manage a collection of disjoint (non-overlapping) sets. It supports two primary operations: Find: Determine the set to which a particular element belongs. Union: Merge two sets into a single set. The Union-Find…
Floyd-Warshall Algorithm
The Floyd-Warshall algorithm is a dynamic programming algorithm used to find the shortest paths between all pairs of vertices in a weighted graph. Unlike other algorithms such as Dijkstra’s, which computes the shortest path from a single source to all other vertices, the Floyd-Warshall algorithm co…
Kruskal's Algorithm
Kruskal's Algorithm is a greedy algorithm used to find the Minimum Spanning Tree (MST) of a graph. A spanning tree is a subset of the edges that connects all vertices in a graph without any cycles. The minimum spanning tree is the spanning tree with the least total edge weight. Key Concepts: Und…