Questions tagged [sink-vertex]

I have a graph with n nodes as an adjacency matrix. Is it possible to detect a sink in less than O(n) time? If yes, how? If no, how do we prove it? Sink vertex is a vertex that has incoming edges from other nodes and no outgoing edges.

Let's say that there is one vertex with the following property in a DAG: All vertices are connected to it It is not connected to any vertex This is usually called a sink vertex. Is it possible to detect this vertex in O(n), where n is number of…

I found this algorithm for digraphs that checks whether a total sink exists in a graph. https://www.geeksforgeeks.org/determine-whether-universal-sink-exists-directed-graph/ My question is : Is this valid for a non - dag digraph? Because if a cycle…