MCPcopy Index your code
hub / github.com/subbarayudu-j/TheAlgorithms-Python / kahns_algorithm_topo.py

File kahns_algorithm_topo.py

Graphs/kahns_algorithm_topo.py:None–None  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

1# Kahn's Algorithm is used to find Topological ordering of Directed Acyclic Graph using BFS
2def topologicalSort(l):
3 indegree = [0] * len(l)
4 queue = []

Callers

nothing calls this directly

Calls 1

topologicalSortFunction · 0.85

Tested by

no test coverage detected