I was given an assigment to implement topological thread using multiple threads in Python. Though I was not able to compete the assignment on time , I am interested in learning approch to solve the question -

Implement Topological sort for DAG using 5 or more threads using Python -
Initially I started with one master thread push items to a queue once they are ready for being processsed. Then have a pool of workers listen on the queue for tasks to work on. Also, I saw a few research papers used Adjacency Matrix to implement this but I am not sure how to proceed.

If anyone have any ideas I would love to hear.

Thanks in advance.