Interview Bootcamp
Vote

0% completed

​

Introduction to Topological Sort Pattern

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

This pattern defines an easy way to understand the technique for performing topological sorting of a set of elements and then solves a few problems using it.

Let’s see this pattern in action.

.....

.....

.....

Like the course? Get enrolled and start learning!
D

David Alonso

· 3 years ago

Hi, do you have any chapter where it is included explanations and examples about Graph Problems that are solved using Maps? From my experience, this is one of the top questions regarding data structures problems. A typical example should be:

You are working for a social networking company that wants to analyze the connections between its users. Given a list of friendships as edges between users, your task is to determine the number of clusters or distinct social groups present in the network.