Solution: Graphs

Task

A universal sinkA universal sink, v, is also sometimes called a celebrity: Everyone in the room recognizes v, but v doesn’t recognize anyone else in the room. in a graph $G$ is a vertex that is the target of $n − 1$ edges and the source of no edges. Design and implement an algorithm that tests if a graph $G$, represented as an AdjacencyMatrix, has a universal sink. This algorithm runs in $O(n)$ time.

Solution

Here is the code that finds the universal sink in a graph $G$. It consists of the method findUniSinkOn() which is used to find a universal sink in a directed graph.