Skip to content

Glossary: Coding Interviews in C++

Topological sort

A way of ordering tasks so that each one comes after the tasks it depends on. It applies to dependency graphs that have no cycles.

Where the book teaches it

Related terms

GreedyUnion-find