Kahn's Algorithm for Topological Sorting with Pseudo Code | Logic First

Published: 21 August 2020
on channel: Logic First

4,069

What is topological sorting? Kahn's algorithm for finding topological sort and detecting presence of cycles in graph is explained with example. Complete concept building video for kahn's algorithm.

Kahn's algorithm steps,

-Calculate indegree of all vertices
-Initialize visited count to 0
-Where to start? Vertices with indegree 0
-Add all vertices with indegree 0 to a Q
-DeQ a vertex and
-Add it to Topo order list
-Decrement indegree of its adjacent vertices by 1
-If indegree of any vertex becomes 0, add it to Q
-Increment visited count
-Stop when Q is empty
-If visited count equals total nodes, then print topo order
-If not, it indicates presence of cycle

Topological sort video,
   • Topological Sort

Mastering loops playlist,
   • Mastering loops

Learn C programming playlist,
   • Learn C programming

Website link,
https://logicfirstcoding.com/

My Programming channel in Tamil language,
   / @logicfirsttamil

On this page of the site you can watch the video online Kahn's Algorithm for Topological Sorting with Pseudo Code | Logic First with a duration of hours minute second in good quality, which was uploaded by the user Logic First 21 August 2020, share the link with friends and acquaintances, this video has already been watched 4,069 times on youtube and it was liked by 78 viewers. Enjoy your viewing!

18,765

456