Let’s say that a graph is “accessible” if it contains a vertex vthat can reach all the other vertices. In this case, we call v an”access point” of the graph. Describe a simple algorithm forfinding an access point (if one exists) from a topological orderingof a given directed acyclic graph. If the graph is not accessible,your algorithm can return any vertex.
Expert Answer
An answer will be send to you shortly. . . . .