📄️ 01 - Dijkstra's Algorithm
This page explains Dijkstra's Algorithm for finding the shortest path in a graph, with code implementations and resources for further learning.
📄️ 02 - Bellman-Ford Algorithm
This page explains the Bellman-Ford Algorithm for finding the shortest path in a graph with negative weight edges.
📄️ 03 - Floyd-Warshall Algorithm
This page explains the Floyd-Warshall Algorithm for finding the shortest paths between all pairs of vertices in a weighted graph.
📄️ 04 - Kruskal's Algorithm
This page explains Kruskal's Algorithm for finding the minimum spanning tree in a graph.
📄️ 05 - Prim's Algorithm
This page explains Prim's Algorithm for finding the minimum spanning tree in a graph.
📄️ 06 - Kosaraju's Algorithm
This page explains Kosaraju's Algorithm for finding the no of strongly connected component in a graph.
📄️ 07 - Ford Fulkerson's Algorithm
This page explains the Ford Fulkerson's Algorithm for finding the maximum flow,residual flowin a network flow graph.
📄️ 08 - Depth-First Search
This page explains Depth-First Search for traversing or searching tree or graph data structures.
📄️ 09 - Breadth-First Search
This page explains Breadth-First Search for traversing or searching tree or graph data structures.
📄️ 10 - A* Algorithm
This page explains the A* Algorithm for finding the shortest path in a graph using heuristics.
📄️ 11 - Topological Sorting
This page explains Topological Sorting, an algorithm for ordering vertices in a directed acyclic graph (DAG).
📄️ 12 - Johnson's Algorithm
This page explains Johnson's Algorithm, an algorithm for finding shortest paths between all pairs of vertices in a weighted, directed graph.
📄️ 13 - Edmonds-Karp Algorithm
This page explains the Edmonds-Karp Algorithm, an implementation of the Ford-Fulkerson method for computing the maximum flow in a flow network.
📄️ 14 - Kahn's Algorithm
This page explains Kahn's Algorithm, an algorithm for topological sorting of a directed acyclic graph (DAG).
📄️ 15 - Borůvka's Algorithm
This page explains Borůvka's Algorithm, an algorithm for finding the minimum spanning tree (MST) of a graph.
📄️ Tarjan's Algorithm
Tarjan's Algorithm is an efficient method for finding all Strongly Connected Components (SCCs) in a directed graph. An SCC is a maximal subgraph where each vertex is reachable from every other vertex in the subgraph.