39,459 views
This video describes an algorithm that uses depth-first traversal (DFS) to ensure that the edges of a directed graph are all drawn from left to right (i.e. a topological sort of a directed graph). I have already covered this topic (applied to task scheduling) in the following video and I describe a method to solve this problem: • Topological order: drawing a graph... Today's video describes ANOTHER method to do the same operation. If you have to program, this 2nd method is recommended. Since it uses DFS, I invite you to watch or rewatch my two videos on this very important algorithm. • Depth-first traversal of a graph More technical, detailed and complete video: • DEEP-FLOW (DFS) traversal of a graph