Graphs: find a sink in less than O(|V|) - or show it can't be done...

Detecting the sink in a directed acyclic graph...