Topological Sort

This video explains the algorithm and code for finding out the topological sorted order of a directed acyclic graph.

Github link - https://github.com/IDeserve/learn/blob/master/topologicalSort.java

The steps of this algorithm are -
1. Start with a vertex ‘v’ having in-degree = 0.

2. Print ‘v’. Remove the vertex ‘v’ and all edges coming out of it.

3. Repeat above two steps till all vertices are removed.

Website: http://www.ideserve.co.in

Facebook: https://www.facebook.com/IDeserve.co.in

Видео Topological Sort канала IDeserve