Q. Explain various graph traversal schemes and write their advantages and disadvantages.

Ans.

Graph Traversal Scheme is explained below

In many troubles we wish to investigate the total vertices in a graph in some systematic order. In graph we frequently do not have any one vertex singled out as special and therefore the traversal may begin at an arbitrary vertex. The two famous methods or techniques for traversing are:-

a) Depth first traversal is explained below:
The breadth traversal of a graph is roughly analogous to pre-order traversal of an ordered tree. Assume that the traversal has just visited a vertex or, and let W0, W1,......Wk be the vertices near to V. Then we shall next visit W0 and keep W1.....Wk  waiting. After visiting W0  we traverse all the vertices to which it is near before returning to traverse W1, W2, ........Wk.

b) Breadth first traversal: of a graph is around analogous to level by level traversal of ordered tree. If the traversal has just visited a vertex V, then it next visits all the vertices adjoining to V. Putting the vertices adjoining to these is a waiting list to be traversed after all the vertices adjoining to V have been visited. The figure below shows the order of visiting the vertices of one graph under both DFS and BFS.

DFT = 1 2 3 4 5 6 7 8 9

BFT= 1 2 9 3 5 6 4 7 8

Posted Date: 7/13/2012 2:28:12 AM | Location : United States

Ask an Expert

Related Discussions:- Graph traversal schemes, Assignment Help, Ask Question on Graph traversal schemes, Get Answer, Expert's Help, Graph traversal schemes Discussions

Write discussion on Graph traversal schemes
Your posts are moderated

Write your message here..

Related Questions

Stacks, reverse the order of elements on a stack S using two additional sta... reverse the order of elements on a stack S using two additional stacks using one additional stack

Comp. sci algorithms, 1. develop an algorithm which reads two decimal numbe... 1. develop an algorithm which reads two decimal numbers x and y and determines and prints out wether x>y or y>x. the input values, x and y, are whole number > or equal to 0, which

Order of the matrix, /* The program accepts matrix like input & prints the ... /* The program accepts matrix like input & prints the 3-tuple representation of it*/ #include void main() { int a[5][5],rows,columns,i,j; printf("enter the order of

Define queue, A queue is a, FIFO (First In First Out) list. A queue is a, FIFO (First In First Out) list.

Characterstics of good algorithm, what are the charaterstics to determine w... what are the charaterstics to determine weather an algorithm is good or not? explain in detail

Total weight of minimum spanning tree, a) Run your program for α = 0.05, 0... a) Run your program for α = 0.05, 0.5, and 0.95. You can use n = 30, and W = 10. What is impact of increasing value of α on connectivity of G'? To answer this question, for each v

Which sorting algorithms not have running time of o (n2), Which sorting al... Which sorting algorithms does not have a worst case running time of  O (n 2 ) ? Merge sort

Define heap, HEAP  A heap is described to be a binary tree with a key i... HEAP  A heap is described to be a binary tree with a key in every node, such that  1-All the leaves of the tree are on 2 adjacent levels. 2- All leaves on the lowest leve

Explain critical path and chain, 1.  Using the traditional method of CPM: ... 1.  Using the traditional method of CPM: a.  What activities are on the critical path? b.  What is the expected total lead time of the project? 2.  Using CCPM: a.  What

Union & intersection of two linklist, how to write an algorithm for unions ... how to write an algorithm for unions & intersection of two linklists?