Graph Traversal

In many problems we wish to investigate all the vertices in a graph in some systematic order. In graph we often do not have any single vertex singled out as special and thus the traversal may start at an arbitary vertex.

 

Posted Date: 5/10/2013 5:46:56 AM | Location : United States

Ask an Expert

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

Write discussion on Explain graph traversal
Your posts are moderated

Write your message here..

Related Questions

C++, #What is the pointer #What is the pointer

Curve, write a c++ program to find out the area of a curve y=f(x) between x... write a c++ program to find out the area of a curve y=f(x) between x=a and x=b

Define minimum spanning tree, Define Minimum Spanning Tree A minimum sp... Define Minimum Spanning Tree A minimum spanning tree of a weighted linked graph is its spanning tree of the smallest weight, where the weight of a tree is explained as the sum

What is called the basic operation of an algorithm, What is called the basi... What is called the basic operation of an algorithm? The most significant operation of the algorithm is the operation contributing the most to the total running time is known as

What is Polyphase Sort, One of the best known methods for external sorting ... One of the best known methods for external sorting on tapes is the polyphase sort. Principle: The basic strategy of this sort is to distribute ordered initial runs of predetermi

Explain avl tree, AVL tree An AVL tree is a binary search tree in which... AVL tree An AVL tree is a binary search tree in which the height of the left and right subtree of the root vary by at most 1 and in which the left and right subtrees are again

Frequency count, what is frequency count what is frequency count

What is quick sort, What is quick sort? Quick sort is a sorting algorit... What is quick sort? Quick sort is a sorting algorithm that uses the idea if split and conquer. This algorithm chooses an element called as pivot element; search its position in

Declaring a two dimensional array, Declaring a two dimensional array   A... Declaring a two dimensional array   A two dimensional array is declared same to the way we declare a one-dimensional array except that we state the number of elements in both di

State in brief about assertion, State  in brief about assertion Asser... State  in brief about assertion Assertion: A statement which should be true at a designated point in a program.