complexity of algo for detection of universal sink in directed graph

Question

minimum running time of algo that determines universal sink in a directed graph G={V,E} - a vertex with indegree |V|-1 and outdegree 0, given an adjacency matrix for G is:

omega(V^2)   O(V)     O(V+E)  none

Answer 1

http://stackoverflow.com/questions/29259365/how-to-find-the-universal-sink-of-a-directed-graph-with-an-adjacency-matrix-repr