POJ 2186 - Popular Cows
Problem : Find the number of vertices which can be reached by all other vertices.
Solution : Merge the graph based on strongly connected set to become DAG G'. If there is only one vertice in G' with no out-degree, the answer is all vertices merged into that vertice. Otherwise, the answer is 0.