TechnologyBeginner

Graph Algorithms: Traversal, Shortest Paths, MST & Connectivity

Name: Graph Algorithms: Traversal, Shortest Paths, MST & Connectivity
Price: 499 INR
Availability: InStock

Master essential graph algorithms used across computer science and software engineering. You'll explore BFS and DFS traversal, path finding, cycle detection, and topological sorting, then move into shortest-path methods like Dijkstra and Bellman-Ford. The course also covers minimum spanning trees with Prim's algorithm and advanced connectivity topics including Kosaraju's SCC, bridges, and articulation points via Tarjan's algorithm.

What You'll Learn

Traverse graphs using BFS and DFS and enumerate all paths between nodes

Detect cycles in both undirected and directed graphs

Perform topological sorting on directed acyclic graphs

Compute shortest distances using Dijkstra's and Bellman-Ford algorithms

Build minimum spanning trees with Prim's algorithm

Find strongly connected components, bridges, and articulation points using Kosaraju's and Tarjan's algorithms

About this course

Graph Algorithms: Traversal, Shortest Paths, MST & Connectivity is a self-paced beginner-level technology online course on GreyAcademy, taught by Anurag Trivedi. It has 2 modules and 5 chapters, and it takes about 10 hours to complete. Enrol once and learn at your own pace. You get a completion certificate when you finish all the lessons.

Topics covered: BFS, Part2, Dijkstra’s Algorithm (Shortest Distance), Prim’s Algorithm (MST), Bridge in Graph (Tarjan’s Algorithm).

Not sure where to start? Compare this with other online courses or follow a career roadmap.