[go: up one dir, main page]
Scribd
Upload
11 views1 page

Graph Algorithms Revision Tracker

The document outlines key graph algorithms and concepts essential for data structure and algorithm (DSA) revision. It covers graph traversals, cycle detection, topological sorting, shortest path algorithms, minimum spanning tree algorithms, and advanced graph algorithms. Each section includes specific algorithms such as Dijkstra's, Bellman-Ford, Prim's, and Kruskal's, along with optional advanced topics like strongly connected components and disjoint sets.

Uploaded by

margammanisha7
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views1 page

Graph Algorithms Revision Tracker

The document outlines key graph algorithms and concepts essential for data structure and algorithm (DSA) revision. It covers graph traversals, cycle detection, topological sorting, shortest path algorithms, minimum spanning tree algorithms, and advanced graph algorithms. Each section includes specific algorithms such as Dijkstra's, Bellman-Ford, Prim's, and Kruskal's, along with optional advanced topics like strongly connected components and disjoint sets.

Uploaded by

margammanisha7
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Graph Algorithms - DSA Revision Tracker

Graph Traversals & Basics

Clone a Graph (DFS/BFS)

Detect Cycle in Undirected Graph (DFS & BFS)

Detect Cycle in Directed Graph (DFS & BFS)

Number of Islands (Graph and Grid-based)

Bipartite Check using BFS

Bipartite Check using DFS

Topological Sorting

Topological Sort (DFS based)

Topological Sort (BFS - Kahn's Algorithm)

Shortest Path Algorithms

Dijkstra's Algorithm (Greedy - Priority Queue)

Bellman-Ford Algorithm (Handles negative weights)

Floyd-Warshall Algorithm (All pairs shortest path)

Minimum Spanning Tree (MST)

Prim's Algorithm (PQ-based)

Kruskal's Algorithm (Union-Find / DSU)

Advanced Graph Algorithms

Strongly Connected Components (Kosaraju's Algorithm)

Optional: Bridge & Articulation Points (Tarjan's)

Optional: Tarjan's SCC Algorithm

Optional: Disjoint Set (Union by Rank, Path Compression)

You might also like