Topological sorting is a linear ordering of vertices in a directed graph such that for every edge, the start vertex comes before the end vertex. It is used to sequence tasks and can be applied to any Directed Acyclic Graph (DAG). Algorithms exist to construct a topological ordering in linear time.
University of Washington
Summer 2022
This course focuses on common data structures and algorithms. It integrates theoretical understanding with practical exercises, preparing students for software-related roles and industry technical interviews. Programming projects, unit testing, and source control techniques are emphasized.
No concepts data
+ 27 more conceptsUC Berkeley
Spring 2020
This is an introductory course to computer science theory, exploring the design and analysis of various algorithms, number theory, and complexity. The prerequisites include familiarity with mathematical induction, big-O notation, basic data structures, and programming in a standard language.
No concepts data
+ 36 more concepts