{"id":27102,"date":"2018-01-03T21:24:07","date_gmt":"2018-01-03T15:54:07","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=27102"},"modified":"2018-01-03T21:24:07","modified_gmt":"2018-01-03T15:54:07","slug":"java-programming-bridges-graph","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/java-programming-bridges-graph\/","title":{"rendered":"JAVA programming – Bridges in a graph"},"content":{"rendered":"

An edge in an undirected connected graph is a bridge iff removing it disconnects the graph. <\/span>For a disconnected undirected graph, definition is similar, a bridge is an edge removing which increases number of connected components.
\nLike Articulation Points<\/a>,bridges represent vulnerabilities in a connected network and are useful for designing reliable networks. For example, in a wired computer network, an articulation point indicates the critical computers and a bridge indicates the critical wires or connections.<\/p>\n

Following are some example graphs with bridges highlighted with red color.<\/p>\n

How to find all bridges in a given graph?<\/strong>
\nA simple approach is to one by one remove all edges and see if removal of a edge causes disconnected graph. Following are steps of simple approach for connected graph.<\/p>\n

1) For every edge (u, v), do following
\n\u2026..a) Remove (u, v) from graph
\n..\u2026b) See if the graph remains connected (We can either use BFS or DFS)
\n\u2026..c) Add (u, v) back to the graph.<\/p>\n

Time complexity of above method is O(E*(V+E)) for a graph represented using adjacency list. Can we do better?<\/p>\n[ad type=”banner”]\n

A O(V+E) algorithm to find all Bridges<\/strong>
\nThe idea is similar to O(V+E) algorithm for Articulation Points<\/a>. We do DFS traversal of the given graph. In DFS tree an edge (u, v) (u is parent of v in DFS tree) is bridge if there does not exit any other alternative to reach u or an ancestor of u from subtree rooted with v. As discussed in the previous post<\/a>, the value low[v] indicates earliest visited vertex reachable from subtree rooted with v. The condition for an edge (u, v) to be a bridge is, \u201clow[v] > disc[u]\u201d<\/em>.<\/p>\n

<\/div> 
\/\/ A Java program to find bridges in a given undirected graphimport java.io.*;import java.util.*;import java.util.LinkedList; \/\/ This class represents a undirected graph using adjacency list\/\/ representationclass Graph{    private int V;   \/\/ No. of vertices     \/\/ Array  of lists for Adjacency List Representation    private LinkedList<Integer> adj[];    int time = 0;    static final int NIL = -1;     \/\/ 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);  \/\/ Add w to v's list.        adj[w].add(v);  \/\/Add v to w's list    }     \/\/ A recursive function that finds and prints bridges    \/\/ using DFS traversal    \/\/ u --> The vertex to be visited next    \/\/ visited[] --> keeps tract of visited vertices    \/\/ disc[] --> Stores discovery times of visited vertices    \/\/ parent[] --> Stores parent vertices in DFS tree    void bridgeUtil(int u, boolean visited[], int disc[],                    int low[], int parent[])    {         \/\/ Count of children in DFS Tree        int children = 0;         \/\/ Mark the current node as visited        visited[u] = true;         \/\/ Initialize discovery time and low value        disc[u] = low[u] = ++time;         \/\/ Go through all vertices aadjacent to this        Iterator<Integer> i = adj[u].iterator();        while (i.hasNext())        {            int v = i.next();  \/\/ v is current adjacent of u             \/\/ If v is not visited yet, then make it a child            \/\/ of u in DFS tree and recur for it.            \/\/ If v is not visited yet, then recur for it            if (!visited[v])            {                parent[v] = u;                bridgeUtil(v, visited, disc, low, parent);                 \/\/ Check if the subtree rooted with v has a                \/\/ connection to one of the ancestors of u                low[u]  = Math.min(low[u], low[v]);                 \/\/ If the lowest vertex reachable from subtree                \/\/ under v is below u in DFS tree, then u-v is                \/\/ a bridge                if (low[v] > disc[u])                    System.out.println(u+" "+v);            }             \/\/ Update low value of u for parent function calls.            else if (v != parent[u])                low[u]  = Math.min(low[u], disc[v]);        }    }      \/\/ DFS based function to find all bridges. It uses recursive    \/\/ function bridgeUtil()    void bridge()    {        \/\/ Mark all the vertices as not visited        boolean visited[] = new boolean[V];        int disc[] = new int[V];        int low[] = new int[V];        int parent[] = new int[V];          \/\/ Initialize parent and visited, and ap(articulation point)        \/\/ arrays        for (int i = 0; i < V; i++)        {            parent[i] = NIL;            visited[i] = false;        }         \/\/ Call the recursive helper function to find Bridges        \/\/ in DFS tree rooted with vertex 'i'        for (int i = 0; i < V; i++)            if (visited[i] == false)                bridgeUtil(i, visited, disc, low, parent);    }     public static void main(String args[])    {        \/\/ Create graphs given in above diagrams        System.out.println("Bridges in first graph ");        Graph g1 = new Graph(5);        g1.addEdge(1, 0);        g1.addEdge(0, 2);        g1.addEdge(2, 1);        g1.addEdge(0, 3);        g1.addEdge(3, 4);        g1.bridge();        System.out.println();         System.out.println("Bridges in Second graph");        Graph g2 = new Graph(4);        g2.addEdge(0, 1);        g2.addEdge(1, 2);        g2.addEdge(2, 3);        g2.bridge();        System.out.println();         System.out.println("Bridges in Third graph ");        Graph g3 = new Graph(7);        g3.addEdge(0, 1);        g3.addEdge(1, 2);        g3.addEdge(2, 0);        g3.addEdge(1, 3);        g3.addEdge(1, 4);        g3.addEdge(1, 6);        g3.addEdge(3, 5);        g3.addEdge(4, 5);        g3.bridge();    }}<\/code><\/pre> <\/div>\n[ad type=”banner”]\nOutput:<\/p>\n
Bridges in first graph\r\n3 4\r\n0 3\r\n\r\nBridges in second graph\r\n2 3\r\n1 2\r\n0 1\r\n\r\nBridges in third graph\r\n1 6<\/pre>\n","protected":false},"excerpt":{"rendered":"
JAVA programming – Bridges in a graph – An edge in an undirected connected graph is a bridge iff removing it disconnects the graph.<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[78385,73906,2139],"tags":[83836,83837,83830,83833,83831,83834,83835,83832],"class_list":["post-27102","post","type-post","status-publish","format-standard","hentry","category-connectivity","category-graph-algorithms","category-java","tag-articulation-point-program-in-c","tag-articulation-point-using-dfs-algorithm","tag-articulation-points-or-cut-vertices-in-a-graph","tag-articulation-points-java","tag-consider-the-following-graph-l-and-find-the-bridges-if-any","tag-cut-vertex-and-bridges","tag-find-all-nodes-in-a-graph-that-remove-any-1-of-them-would-cause-the-graph-to-disconnect","tag-show-how-to-compute-all-the-bridges-of-g-in-oe-time"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27102","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=27102"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27102\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=27102"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=27102"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=27102"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}