MCPcopy Create free account
hub / github.com/subbarayudu-j/TheAlgorithms-Python / kahns_algorithm_long.py

File kahns_algorithm_long.py

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

Source from the content-addressed store, hash-verified

1# Finding longest distance in Directed Acyclic Graph using KahnsAlgorithm
2def longestDistance(l):
3 indegree = [0] * len(l)
4 queue = []

Callers

nothing calls this directly

Calls 1

longestDistanceFunction · 0.85

Tested by

no test coverage detected