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

Publicado em: 21 Agosto 2020
no canal de: 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

Nesta página do site você pode assistir ao vídeo on-line Kahn's Algorithm for Topological Sorting with Pseudo Code | Logic First duração hora minuto segundo em boa qualidade , que foi baixado pelo usuário Logic First 21 Agosto 2020, compartilhe o link com seus amigos e conhecidos, no youtube este vídeo já foi visto 4,069 vezes e gostou 78 espectadores. Boa visualização!

5,147

474