1. Engineering
  2. Computer Science
  3. given a graph g v e a vertex v...

Question: given a graph g v e a vertex v...

Question details

Given a graph G (V, E), a vertex v is called sink if there are no outgoing edges from v. A vertex v is called super sink if v is a sink and for every vertex u E V, there is an edge from u to v. Prove that every DAG (Directed Acyclic Graph) has a sink. Suppose you are given a graph G (V, E) in adjacency matrix representation. Give an algorithm to compute super sink, if exists. Derive the time bound of your algorithm Your grade depends the run time of your algorithm.

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution