Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...

Q # 1 : in which graph algorithm do we start finding
vertices that should be first in the topological order and
then apploy the fact that every vertex must come before its
successors in the topolgical order.

Answer Posted / vinoth kumar.r

To my understanding of the question it sounds like
topological sort

Is This Answer Correct ?    3 Yes 2 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

Write the disadvantages of separate chaining?

912


How to show internal storage representation of data structure in RDBM?

986


Explain heapsort. What is its complexity?

987


What is binary tree used for?

960


What is the idea behind splaying?

1794


How can you represent a linked list node?

956


How do you represent a linked list?

909


What do you mean by free pool?

1089


What is Doubly link list?

957


What is the time complexity of arraylist and linked list?

926


Why do we use insertion sort?

865


Why hashtable is faster than arraylist?

950


What's difference between stack and queue?

964


How to reference all the elements in a one-dimension array?

1290


Is binary tree a binary search tree?

850