Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
DFS Continuation: Topological Sort
In course
DEMO: Lorem aliqua tempor
Velit Lorem sint consequat velit ipsum anim enim et eu reprehenderit voluptate velit incididunt officia. Nostrud do anim labore occaecat. Ad velit nulla non deserunt nulla enim sit ea. Incididunt sit officia fugiat deserunt ut eiusmod.
Description
This lecture covers the continuation of Depth-First Search (DFS) with topics such as the output of DFS, classification of edges, the Parenthesis theorem, the White-path theorem, and the Topological Sort algorithm. It also explains when a directed graph is acyclic, the correctness of the algorithm, time analysis, Strongly Connected Components (SCC), and the magic algorithm to find SCCs.
Instructors (2)
amet excepteur deserunt esse
Deserunt officia in qui irure occaecat culpa exercitation ut. Officia ullamco culpa do reprehenderit non tempor minim nisi do labore officia fugiat do. Ad labore minim culpa ipsum occaecat nostrud excepteur Lorem irure et ea dolore velit culpa.
laboris excepteur
Aute eiusmod consequat irure sunt. Fugiat quis exercitation in minim. Laboris nisi consectetur culpa velit dolore. Eu dolore sunt dolore aliquip. Ullamco commodo veniam Lorem aliqua sunt excepteur exercitation reprehenderit culpa eu nulla dolor ea.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ontological neighbourhood