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
Define File organization''s and it''s types

Algorithm to find sum of square of a number

Given a list containing Province, CustomerName and SalesValue (sorted by Province and CustomerName), describe an algorithm you could use that would output each CustomerName and Sal

How to measure the algorithm's efficiency? It is logical to examine the algorithm's efficiency as a function of some parameter n showing the algorithm's input size. Instance

Ask consider the file name cars.text each line in the file contains information about a car ( year,company,manufacture,model name,type) 1-read the file 2-add each car which is repr

Memory Allocation Strategies If it is not desirable to move blocks of due storage from one area of memory to another, it must be possible to relocate memory blocks that have be

Q. Draw  the structures of complete  undirected  graphs  on  one,  two,  three,  four  and  five vertices also prove that the number of edges in an n vertex complete graph is n(n-1

Q. Implement a stack making use of the linked list. Show the PUSH and POP operations both. A n s . Stack implemantation using linked list # include # include

Gouraud Shading The faceted appearance of a Lambert shaded model is due to each polygon having only a single colour. To avoid this effect, it is necessary to vary the colour ac

Since the stack is list of elements, the queue is also a list of elements. The stack & the queue differ just in the position where the elements may be added or deleted. Similar to