{"id":26332,"date":"2017-10-26T21:02:32","date_gmt":"2017-10-26T15:32:32","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=26332"},"modified":"2017-10-26T21:02:32","modified_gmt":"2017-10-26T15:32:32","slug":"java-algorithm-check-given-graph-tree-not","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/java-algorithm-check-given-graph-tree-not\/","title":{"rendered":"Java Algorithm – Check if a given graph is tree or not"},"content":{"rendered":"

Write a function that returns true if a given undirected graph is tree and false otherwise. For example, the following graph is a tree.<\/span><\/p>\n

 <\/p>\n

But the following graph is not a tree.<\/p>\n

An undirected graph is tree if it has following properties.
\n1) There is no cycle.
\n2) The graph is connected.<\/p>\n

For an undirected graph we can either use BFS or DFS to detect above two properties.<\/p>\n

How to detect cycle in an undirected graph?<\/strong>
\nWe can either use BFS or DFS. For every visited vertex \u2018v\u2019, if there is an adjacent \u2018u\u2019 such that u is already visited and u is not parent of v, then there is a cycle in graph. If we don\u2019t find such an adjacent for any vertex, we say that there is no cycle (See Detect cycle in an undirected graph for more details).<\/p>\n

How to check for connectivity?<\/strong>
\nSince the graph is undirected, we can start BFS or DFS from any vertex and check if all vertices are reachable or not. If all vertices are reachable, then graph is connected, otherwise not.<\/p>\n[ad type=”banner”]\n

Java \u00a0Programming:<\/strong><\/p>\n

<\/div> 
\/\/ A Java Program to check whether a graph is tree or notimport java.io.*;import java.util.*; \/\/ 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);        adj[w].add(v);    }     \/\/ A recursive function that uses visited[] and parent    \/\/ to detect cycle in subgraph reachable from vertex v.    Boolean isCyclicUtil(int v, Boolean visited[], int parent)    {        \/\/ Mark the current node as visited        visited[v] = true;        Integer i;         \/\/ Recur for all the vertices adjacent to this vertex        Iterator<Integer> it = adj[v].iterator();        while (it.hasNext())        {            i = it.next();             \/\/ If an adjacent is not visited, then recur for            \/\/ that adjacent            if (!visited[i])            {                if (isCyclicUtil(i, visited, v))                    return true;            }             \/\/ If an adjacent is visited and not parent of             \/\/ current vertex, then there is a cycle.            else if (i != parent)               return true;        }        return false;    }     \/\/ Returns true if the graph is a tree, else false.    Boolean isTree()    {        \/\/ Mark all the vertices as not visited and not part        \/\/ of recursion stack        Boolean visited[] = new Boolean[V];        for (int i = 0; i < V; i++)            visited[i] = false;         \/\/ The call to isCyclicUtil serves multiple purposes        \/\/ It returns true if graph reachable from vertex 0        \/\/ is cyclcic. It also marks all vertices reachable        \/\/ from 0.        if (isCyclicUtil(0, visited, -1))            return false;         \/\/ If we find a vertex which is not reachable from 0        \/\/ (not marked by isCyclicUtil(), then we return false        for (int u = 0; u < V; u++)            if (!visited[u])                return false;         return true;    }     \/\/ Driver method    public static void main(String args[])    {        \/\/ Create a graph given in the above diagram        Graph g1 = new Graph(5);        g1.addEdge(1, 0);        g1.addEdge(0, 2);        g1.addEdge(0, 3);        g1.addEdge(3, 4);        if (g1.isTree())            System.out.println("Graph is Tree");        else            System.out.println("Graph is not Tree");         Graph g2 = new Graph(5);        g2.addEdge(1, 0);        g2.addEdge(0, 2);        g2.addEdge(2, 1);        g2.addEdge(0, 3);        g2.addEdge(3, 4);         if (g2.isTree())            System.out.println("Graph is Tree");        else            System.out.println("Graph is not Tree");     }}\/\/ This code is contributed by Aakash Hasija<\/code><\/pre> <\/div>\n
Output:<\/strong><\/p>\n
Graph is Tree\r\nGraph is not Tree<\/pre>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"
Java Algorithm – Check if a given graph is tree or not –  Graph Algorithm – Write a function that returns true if a given undirected graph is tree <\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[69969,1,74168,73906,2139],"tags":[78368,78369,76188,76546,76186,76185,76184,76189,76183,76187,78370,76190,78367],"class_list":["post-26332","post","type-post","status-publish","format-standard","hentry","category-algorithm","category-coding","category-dfs-and-bfs","category-graph-algorithms","category-java","tag-c-program-to-check-whether-the-given-graph-is-tree","tag-c-program-to-detect-cycle-in-a-graph","tag-detect-cycle-in-a-graph-c-code","tag-detect-cycle-in-directed-graph","tag-detect-cycle-in-directed-graph-c","tag-detect-cycle-in-directed-graph-in-c","tag-detect-cycle-in-directed-graph-java","tag-detect-cycle-in-graph-using-bfs","tag-detect-cycle-in-undirected-graph","tag-detect-cycle-in-undirected-graph-in-c","tag-dfs-pseudocode","tag-find-all-cycles-in-a-directed-graph","tag-how-to-check-if-a-graph-is-a-tree"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26332","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=26332"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26332\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=26332"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=26332"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=26332"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}