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

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, https://www.youtube.com/watch?v=NjpZ6KiGGEg Mastering loops playlist, https://www.youtube.com/playlist?list=PLlG7M0JiknNGQdm1UvBtr3yjrGKZuNUJa Learn C programming playlist, https://www.youtube.com/playlist?list=PLlG7M0JiknNGUVfGMpIVQ-myOp2D7fnen Website link, https://logicfirstcoding.com/ My Programming channel in Tamil language, https://www.youtube.com/channel/UCXhbCCZAG4GlaBLm80ZL-iA