Topological Sort - Graph Algorithms
Master Topological Sort, the ordering of a directed acyclic graph so every edge points forward. Compute in-degrees, build an order with Kahn's algorithm in your language of choice, detect cycles, and find the longest path in a DAG.
Topics
Syllabus
3 chapters9 lessons1 project3 challenges55 quiz questionsIntroduction
2 lessons17- 01Introduction
- 02Motivation
The Algorithm
Project5 lessons138- 01How it works?
- 02Pseudo Code
- 03Implementation (Part 1)
- 04Implementation (Part 2)
- 05Time and Space Complexity
Final Challenges
2 lessons2- 01Final Challenge #1
- 02Final Challenge #2
More like this
Depth-First Search - Graph Algorithms
Master Depth-First Search, a fundamental way to explore a graph. Build the adjacency lookup, write an iterative DFS in your language of choice, analyze its O(V + E) complexity, and use it to count and measure connected components.
Certificate on completion
- 9
- 3
- 1
- 54
Dijkstra's Algorithm - Graph Algorithms
Master Dijkstra's Algorithm, the greedy single-source shortest-path method for graphs with non-negative weights. Read weighted edges, build the full distance computation in your language of choice, and answer point-to-point and farthest-vertex queries.
Certificate on completion
- 9
- 3
- 1
- 54
Breadth-First Search - Graph Algorithms
Master Breadth-First Search, the layer-by-layer graph traversal behind shortest paths. Build the neighbor lookup, write an iterative BFS with a queue in your language of choice, and use it to find shortest-path distances in unweighted graphs.
Certificate on completion
- 9
- 3
- 1
- 54
Graphs - Data Structures Series #9
In this course, you will learn about the Graph data structure, create an undirected graph from zero in your preferred language, and practice coding challenges with it!
Certificate on completion
- 14
- 12
Bellman-Ford Algorithm - Graph Algorithms
Master the Bellman-Ford algorithm: single-source shortest paths that work with negative edge weights, plus negative-cycle detection. Build a relaxation pass, the full algorithm in your language of choice, and answer distance and cycle queries.
Certificate on completion
- 9
- 3
- 1
- 54
Frequently asked questions
How many lessons does Topological Sort - Graph Algorithms have?
What does Topological Sort - Graph Algorithms cover?
Is Topological Sort - Graph Algorithms free?
