{"id":26343,"date":"2017-10-26T21:09:54","date_gmt":"2017-10-26T15:39:54","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=26343"},"modified":"2018-10-29T12:11:01","modified_gmt":"2018-10-29T06:41:01","slug":"java-programming-find-path-two-vertices-directed-graph","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/java-programming-find-path-two-vertices-directed-graph\/","title":{"rendered":"Find if there is a path between two vertices in a directed graph"},"content":{"rendered":"

Given a Directed Graph<\/a> and two vertices in it, check whether there is a path from the first given vertex to second. <\/span>For example, in the following graph, there is a path from vertex 1 to 3. As another example, there is no path from 3 to 0.<\/p>\n

We can either use Breadth First Search<\/a> (BFS) or Depth First Search<\/a> (DFS) to find path between two vertices. Take the first vertex as source in BFS (or DFS), follow the standard BFS (or DFS). If we see the second vertex in our traversal, then return true. Else return false.<\/p>\n

Following is Java code implementation<\/a>, that use BFS for finding reachability of second vertex<\/a> from first vertex.<\/p>\n

\"directed-graph\"<\/p>\n

Java\u00a0Programming to Find if there is a path between two vertices in a directed graph:<\/span><\/h3>\n
<\/div> 
\/\/ Java program to check if there is exist a path between two vertices\/\/ of a graph.import java.io.*;import java.util.*;import java.util.LinkedList; class Graph{    private int V;       private LinkedList<Integer> adj[];      Graph(int v)    {        V = v;        adj = new LinkedList[v];        for (int i=0; i<v; ++i)            adj[i] = new LinkedList();    }     void addEdge(int v,int w)  {   adj[v].add(w);   }        Boolean isReachable(int s, int d)    {        LinkedList<Integer>temp;                boolean visited[] = new boolean[V];            LinkedList<Integer> queue = new LinkedList<Integer>();                 visited[s]=true;        queue.add(s);               Iterator<Integer> i;        while (queue.size()!=0)        {                       s = queue.poll();             int n;            i = adj[s].listIterator();                         while (i.hasNext())            {                n = i.next();                                 if (n==d)                    return true;                                if (!visited[n])                {                    visited[n] = true;                    queue.add(n);                }            }        }             return false;    }        public static void main(String args[])    {                Graph g = new Graph(4);        g.addEdge(0, 1);        g.addEdge(0, 2);        g.addEdge(1, 2);        g.addEdge(2, 0);        g.addEdge(2, 3);        g.addEdge(3, 3);         int u = 1;        int v = 3;        if (g.isReachable(u, v))            System.out.println("There is a path from " + u +" to " + v);        else            System.out.println("There is no path from " + u +" to " + v);;         u = 3;        v = 1;        if (g.isReachable(u, v))            System.out.println("There is a path from " + u +" to " + v);        else            System.out.println("There is no path from " + u +" to " + v);;    }}<\/code><\/pre> <\/div>\n
Output:<\/span><\/h3>\n
 There is a path from 1 to 3\r\n There is no path from 3 to 1<\/pre>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"
Java Programming – Find if there is a path between two vertices in a directed graph – check whether there is a path from the first given vertex to second. <\/p>\n","protected":false},"author":1,"featured_media":31628,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[69969,1,78385,73906,2139],"tags":[78426,78421,78420,78419,78424,78423,78417,78425],"class_list":["post-26343","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-algorithm","category-coding","category-connectivity","category-graph-algorithms","category-java","tag-bfs-find-all-paths","tag-find-all-paths-between-two-nodes-in-a-graph-c","tag-find-all-paths-between-two-nodes-in-a-graph-java","tag-find-all-paths-from-source-to-destination","tag-find-all-paths-from-source-to-destination-java","tag-find-all-paths-in-a-directed-graph","tag-find-all-possible-paths-between-two-vertices-on-a-graph","tag-find-path-between-two-nodes-in-a-tree"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26343","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=26343"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26343\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media\/31628"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=26343"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=26343"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=26343"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}