{"id":26411,"date":"2017-12-20T21:18:39","date_gmt":"2017-12-20T15:48:39","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=26411"},"modified":"2017-12-20T21:18:39","modified_gmt":"2017-12-20T15:48:39","slug":"java-programming-check-graph-strongly-connected-set-1-kosaraju-using-dfs","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/java-programming-check-graph-strongly-connected-set-1-kosaraju-using-dfs\/","title":{"rendered":"JAVA programming – Check if a graph is strongly connected"},"content":{"rendered":"

Given a directed graph, find out whether the graph is strongly connected or not. A directed graph is strongly connected if<\/span> there is a path between any two pair of vertices. For example, following is a strongly connected graph.<\/p>\n

It is easy for undirected graph<\/strong>, we can just do a BFS and DFS starting from any vertex. If BFS or DFS visits all vertices, then the given undirected graph is connected. This approach won\u2019t work for a directed graph. For example, consider the following graph which is not strongly connected. If we start DFS (or BFS) from vertex 0, we can reach all vertices, but if we start from any other vertex, we cannot reach all vertices.<\/p>\n

How to do for directed graph?<\/strong>
\nA simple idea is to use a all pair shortest path algorithm like Floyd Warshall<\/a> or find Transitive Closure<\/a><\/strong> of graph. Time complexity of this method would be O(v3<\/sup>).<\/p>\n

We can also do DFS <\/a>V times<\/strong> starting from every vertex. If any DFS, doesn\u2019t visit all vertices, then graph is not strongly connected. This algorithm takes O(V*(V+E)) time which can be same as transitive closure for a dense graph.<\/p>\n

A better idea can be Strongly Connected Components (SCC)<\/a> algorithm<\/strong>. We can find all SCCs in O(V+E) time. If number of SCCs is one, then graph is strongly connected. The algorithm for SCC does extra work as it finds all SCCs.<\/p>\n[ad type=”banner”]\n

Following is Kosaraju\u2019s DFS based simple algorithm that does two DFS traversals<\/strong> of graph:
\n1)<\/strong> Initialize all vertices as not visited.<\/p>\n

2)<\/strong> Do a DFS traversal of graph starting from any arbitrary vertex v. If DFS traversal doesn\u2019t visit all vertices, then return false.<\/p>\n

3)<\/strong> Reverse all arcs (or find transpose or reverse of graph)<\/p>\n

4)<\/strong> Mark all vertices as not-visited in reversed graph.<\/p>\n

5)<\/strong> Do a DFS traversal of reversed graph starting from same vertex v (Same as step 2). If DFS traversal doesn\u2019t visit all vertices, then return false. Otherwise return true.<\/p>\n

The idea is, if every node can be reached from a vertex v, and every node can reach v, then the graph is strongly connected. In step 2, we check if all vertices are reachable from v. In step 4, we check if all vertices can reach v (In reversed graph, if all vertices are reachable from v, then all vertices can reach v in original graph).<\/p>\n[ad type=”banner”]\n

JAVA PROGRAMMING<\/p>\n

<\/div> 
\/\/ Java program to check if a given directed graph is strongly\/\/ connected or notimport java.io.*;import java.util.*;import java.util.LinkedList; \/\/ This class represents a directed graph using adjacency\/\/ list representationclass Graph{    private int V;   \/\/ No. of vertices    private LinkedList<Integer> adj[]; \/\/Adjacency List     \/\/Constructor    Graph(int v)    {        V = v;        adj = new LinkedList[v];        for (int i=0; i<v; ++i)            adj[i] = new LinkedList();    }     \/\/Function to add an edge into the graph    void addEdge(int v,int w) {  adj[v].add(w); }     \/\/ A recursive function to print DFS starting from v    void DFSUtil(int v,Boolean visited[])    {        \/\/ Mark the current node as visited and print it        visited[v] = true;         int n;         \/\/ Recur for all the vertices adjacent to this vertex        Iterator<Integer> i = adj[v].iterator();        while (i.hasNext())        {            n = i.next();            if (!visited[n])                DFSUtil(n,visited);        }    }     \/\/ Function that returns transpose of this graph    Graph getTranspose()    {        Graph g = new Graph(V);        for (int v = 0; v < V; v++)        {            \/\/ Recur for all the vertices adjacent to this vertex            Iterator<Integer> i = adj[v].listIterator();            while (i.hasNext())                g.adj[i.next()].add(v);        }        return g;    }     \/\/ The main function that returns true if graph is strongly    \/\/ connected    Boolean isSC()    {        \/\/ Step 1: Mark all the vertices as not visited        \/\/ (For first DFS)        Boolean visited[] = new Boolean[V];        for (int i = 0; i < V; i++)            visited[i] = false;         \/\/ Step 2: Do DFS traversal starting from first vertex.        DFSUtil(0, visited);         \/\/ If DFS traversal doesn't visit all vertices, then        \/\/ return false.        for (int i = 0; i < V; i++)            if (visited[i] == false)                return false;         \/\/ Step 3: Create a reversed graph        Graph gr = getTranspose();         \/\/ Step 4: Mark all the vertices as not visited (For        \/\/ second DFS)        for (int i = 0; i < V; i++)            visited[i] = false;         \/\/ Step 5: Do DFS for reversed graph starting from        \/\/ first vertex. Staring Vertex must be same starting        \/\/ point of first DFS        gr.DFSUtil(0, visited);         \/\/ If all vertices are not visited in second DFS, then        \/\/ return false        for (int i = 0; i < V; i++)            if (visited[i] == false)                return false;         return true;    }     public static void main(String args[])    {        \/\/ Create graphs given in the above diagrams        Graph g1 = new Graph(5);        g1.addEdge(0, 1);        g1.addEdge(1, 2);        g1.addEdge(2, 3);        g1.addEdge(3, 0);        g1.addEdge(2, 4);        g1.addEdge(4, 2);        if (g1.isSC())            System.out.println("Yes");        else            System.out.println("No");         Graph g2 = new Graph(4);        g2.addEdge(0, 1);        g2.addEdge(1, 2);        g2.addEdge(2, 3);        if (g2.isSC())            System.out.println("Yes");        else            System.out.println("No");    }}<\/code><\/pre> <\/div>\n\n\n\n
\n
\n
<\/code><\/code><\/div>\n
\n
Output:<\/p>\n
Yes\r\nNo<\/pre>\n
 
 <\/div> 
JAVA programming-Check if a graph is strongly connected | Set 1 (Kosaraju using DFS)<\/code><\/pre> <\/div>\n<\/div>\n<\/div>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"
JAVA programming-Check if a graph is strongly connected | Set 1 (Kosaraju using DFS)-find out whether the graph is strongly connected or not<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1,78385,73906,2139],"tags":[78756,78755,78422,78754,78751,78750,78753,78752],"class_list":["post-26411","post","type-post","status-publish","format-standard","hentry","category-coding","category-connectivity","category-graph-algorithms","category-java","tag-c-program-to-check-the-connectivity-of-undirected-graph-using-bfs","tag-check-if-graph-is-connected-adjacency-matrix","tag-check-if-path-exists-between-two-nodes","tag-check-if-undirected-graph-is-connected","tag-connected-graph-examples","tag-strongly-connected-graph-example","tag-strongly-connected-undirected-graph","tag-weakly-connected-graph"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26411","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=26411"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26411\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=26411"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=26411"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=26411"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}