An Node Search of DFS with Spanning Tree in Undirected Graphs
D. Jasmine Priskilla1, K. Arulanandam2
1D. Jasmine Priskilla*, Ph.D Research Scholar, Research and Development Centre, Bharathiar University, Coimbatore, Tamil Nadu, India.
2Dr. K. Arulanandam, Head, Department of Computer Applications, GTM College, Gudiyattam, Tamil Nadu, India.
Manuscript received on December 15, 2019. | Revised Manuscript received on December 20, 2019. | Manuscript published on January 10, 2020. | PP: 2465-2470 | Volume-9 Issue-3, January 2020. | Retrieval Number: B7887129219/2020©BEIESP | DOI: 10.35940/ijitee.B7887.019320
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In a graph, spanning tree is a subgraph it is also a tree which relates all the vertices together. So it ‘Spans’ the first graph yet utilizing less edges Graph Search is a calculated plot that visits vertices or edges in a graph, in a request dependent on the availability of the graph. In graph search, edges are visited all things considered once and not all edges are visited. The ones that are visited structure a spanning tree for the vertices that are associated with the beginning vertex by a path. A spanning tree for a lot of vertices VER is a lot of edges without cycles that associates VER. So in a spanning tree, there is actually one path between any two of the vertices. This is the fundamental explanation behind the utility of DFS. DFS utilize stacks and creates insignificant spanning tree fulfilling an assortment of conditions.
Keywords: Shortest Path, Spanning Tree, Undirected Graph, Node Searching, Depth First Search, Breadth First Search
Scope of the Article: Graph Algorithms and Graph Drawing