Graph traversal, Data Structure & Algorithms

1) Which graph traversal uses a queue to hold vertices which are to be processed next ?

2) Which of the graph traversal is recursive by nature?

3) For a dense graph, Prim's algorithm is quicker than Kruskal's algorithm      True/False

4) Which graph traversal technique is utilized to find strongly connected component of any graph?

Posted Date: 4/11/2013 5:11:02 AM | Location : United States







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

Write discussion on Graph traversal
Your posts are moderated
Related Questions
Q. Write down an algorithm for finding a key from a sorted list using the binary search technique or method.

Q. Describe the adjacency matrix and make the same for the given undirected graph.    Ans: The representation of Adjacency Matrix: This representation consists of

Consider the digraph G with three vertices P1,P2 and P3 and four directed edges, one each from P1 to P2, P1 to P3, P2 to P3 and P3 to P1. a. Sketch the digraph. b. Find the a

Efficiency of Linear Search How much number of comparisons is there in this search in searching for a particular element? The number of comparisons based upon where the reco

how to write an algorithm for unions & intersection of two linklists?

Elaborate the symbols of abstract data type length(a)-returns the number of characters in symbol a. capitalize(a)-returns the symbol generated from a by making its first cha

Using the cohen sutherland. Algorithm. Find the visible portion of the line P(40,80) Q(120,30) inside the window is defined as ABCD A(20,20),B(60,20),C(60,40)and D(20,40)

Q. Describe the term array.  How do we represent two-dimensional arrays in memory?  Explain how we calculate the address of an element in a two dimensional array.

Step 1: Declare array 'k' of size 'n' i.e. k(n) is an array which stores all the keys of a file containing 'n' records Step 2: i←0 Step 3: low←0, high←n-1 Step 4: while (l

Multidimensional array: Multidimensional arrays can be defined as "arrays of arrays". For example, a bidimensional array can be imagined as a bidimensional table made of elements,