This week we explore Kahn’s algorithm for topological sorting of Directed Acyclical Graphs, a simple but powerful algorithm introduced in 1962 for the automatic scheduling of computational tasks while taking into account all of their dependencies. As a test case, we apply it to a large citation network dataset
Topological Sorting
Topological Sorting is a …
