notes in figure , is directed path is directed path is not directed path there is no directed cycle in the above graph you may verify the above statement digraph is called strongly connected if there is directed path from any vertex to any other vertex consider the digraph given in figure figure weakly connected graph there does not exist directed path from vertex to vertex also from vertex to other verticesand so on thereforeit is weakly connected graph let us make is strongly connected figure strongly connected graph thegraph in figure strongly connected graph you may notice that we have added just one arc from vertex to vertex lovely professional university