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.

Answers were Sorted based on User's Feedback



Q # 1 : in which graph algorithm do we start finding vertices that should be first in the topologi..

Answer / sriram

i think it is dfs algo......

Is This Answer Correct ?    8 Yes 2 No

Q # 1 : in which graph algorithm do we start finding vertices that should be first in the topologi..

Answer / vinoth kumar.r

To my understanding of the question it sounds like
topological sort

Is This Answer Correct ?    3 Yes 2 No

Q # 1 : in which graph algorithm do we start finding vertices that should be first in the topologi..

Answer / achintya singhal

BFS

Is This Answer Correct ?    0 Yes 0 No

Post New Answer

More Data Structures Interview Questions

Is treemap synchronized?

0 Answers  


Write a Binary Search program

7 Answers   Microsoft, TCS,


Which sorting is best in time complexity?

0 Answers  


What is sort in data structure?

0 Answers  


Can we store primitives in collections?

0 Answers  






What do you mean by union-by-weight?

0 Answers  


how to insert a new node in linked list where free node will be available?

0 Answers  


Define dynamic data structures?

0 Answers  


What is the average number of comparisons needed in a sequential search to determine the position of an element in an array of 100 elements, if the elements are ordered from largest to smallest?

19 Answers   ABB, SDE,


Why is data structure important?

0 Answers  


What are the types of Collision Resolution Techniques and the methods used in each of the type?

1 Answers  


Explain the priority queue?

0 Answers  


Categories