[UVA] 280 - Vertex
Vertex
Write a program that searches a directed graph for vertices which are inaccessible from a given starting
vertex.
A directed graph is represented by n vertices where ,
numbered consecutively , and a
series of edges p -> q which connect the pai...