Solution: Graphs

Review the solution code that finds a universal sink in an AdjacencyMatrix.

We'll cover the following


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 GG is a vertex that is the target of n1n − 1 edges and the source of no edges. Design and implement an algorithm that tests if a graph GG, represented as an AdjacencyMatrix, has a universal sink. This algorithm runs in O(n)O(n) time.


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

Create a free account to access the full course.

By signing up, you agree to Educative's Terms of Service and Privacy Policy