Topological Sort is used to find a linear ordering of elements that have dependencies on each other. For example, if task ‘B’ is dependent on task ‘A’, ‘A’ comes before ‘B’ in topological ordering.

This course will walk you through the technique for performing topological sorting on a set of elements and then solve a few problems using it. We will be using a pattern to solve multiple problems.

Let’s see this pattern in action.