Fish Touching🐟🎣

Topological Sorting

Dec 3, 2022

Call DFS(G) to compute finish times v.f for each vertex v
as each vertex is fnished, insert it onto the front of a linked list
return the linked list of vertices

# Analysis

$\Theta(V+E)$