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
In this project you will write a program to produce a discrete time simulation of a queue as shown in Fig. 1. Time is slotted on the input and the output. Each input packet follows

There are three typical ways of recursively traversing a binary tree. In each of these, the left sub-trees & right sub-trees are visited recursively and the distinguishing feature

What is bubble sort? Bubble Sort: The basic idea in bubble sort is to scan the array to be sorted sequentially various times. Every pass puts the largest element in its corr

The disadvantages or limitations of the last in first out costing method are: The election of last in first out for income tax purposes is binding for all subsequent yea

The quick sort algorithm exploit design technique Divide and Conquer

CMY Model  The cyan, magenta, yellow (CMY) colour model is a subtractive model based on the colour absorption properties of paints and inks. As such it has become the standard

Implementation of Stack :- Stacks can be executed in the 2 ways: a)  Arrays b)  Linked List

I am looking for some help with a data mining class with questions that are about neural networks and decision trees. Can you help? I can send document with questions.

Thus far, we have seen the demonstration of a single queue, but several practical applications in computer science needs several queues. Multi queue is data structure in which mult

Determine about the push operation A Container may or may not be accessible by keys, so it can't make assumptions about element retrieval methods (for example, it cannot have a