Mother vertex of a graph I am trying to find all mother vertex in a directed graph. 

A mother vertex in a directed graph G = (V,E) is a vertex v such that all other vertices in G can be reached by a path from v.

My Approach:

Do DFS on each vertex and check if all the vertex are reached on each start node.
Time complexity : O(V*(V+E)).

I am looking for any better solutions with better complexity.

Any help would be appreciated.
Find the strongly connected components. If the component graph has more than one source, then there are no mother vertices. Otherwise, the mother vertices are those that belong to the single source.