The Source Removal Algorithm is a Decrease-and-Conquer way to topologically sort a directed graph.
A source is a vertex with no incoming edges.

Page created by: Isabel Hinkle and Victoria Gehring

How many nodes would you like to solve?