By mitchp
via architects.dzone.com
Published: Dec 11 2012 / 09:34
We already know what about the topological sort of a directed acyclic graph. So why do we need to revisit this algorithm? First of all I never mentioned its complexity, thus to understand why we do need a revision let’s get again on the algorithm.
Add your comment