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

Ask an Expert

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

Write your message here..

Related Questions

The two famous methods for traversing, The two famous methods for traversin... The two famous methods for traversing are:- a) Depth first traversal b) Breadth first

Algorithmic implementation of multiple stacks, So far, we now have been con... So far, we now have been concerned only with the representation of single stack. What happens while a data representation is required for several stacks? Let us consider an array X

Brute force, Determine the number of character comparisons made by the brut... Determine the number of character comparisons made by the brute-force algorithm in searching for the pattern GANDHI in the text

Visual Basic Assignment, When writing a code for a program that basically a... When writing a code for a program that basically answers Relative Velocity questions how do you go at it? How many conditions should you go through?

Explain the concept of colouring, Colouring The use of colours in CAD/C... Colouring The use of colours in CAD/CAM has two main objectives : facilitate creating geometry and display images. Colours can be used in geometric construction. In this case,

Number of leaf nodes in a complete binary tree, The number of leaf nodes in... The number of leaf nodes in a complete binary tree of depth d is    2 d

What is bubble sort, What is bubble sort? Bubble Sort: The basic ide... 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

Postorder traversal of a binary tree, Postorder traversal of a binary tree ... Postorder traversal of a binary tree struct NODE { struct NODE *left; int value;     /* can take any data type */ struct NODE *right; }; postorder(struct NODE

Algorithm for a function that takes in integer as argument, Write a detaile... Write a detailed description of a function that takes in an integer as an argument, then prints out the squares of all positive integers whose squares are less than the input. (The

Write an algorithm to measure daily temperatures, A geography class decide ... A geography class decide to measure daily temperatures and hours of sunshine each day over a 12 month period (365 days) Write an algorithm, using a flowchart that inputs tempera