Q # 1 : in which graph algorithm do we start finding vertices that should be f

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.

Question Posted / vivinn

3 Answers
6184 Views
I also Faced
E-Mail Answers

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

Define a priority queue?

0 Answers

What is mean by merge sort?

0 Answers

What is data structure and why it is important?

0 Answers

How do you find the time complexity of a bubble sort?

0 Answers

What do you mean by data types?

0 Answers

What are arrays give example?

0 Answers

What is priority queue in data structure?

0 Answers

Explain circular linked list?

0 Answers

What is dynamic array with example?

0 Answers

Do sets allow duplicates?

0 Answers

Can a stack be described as a pointer? Explain.

0 Answers

What do you mean by 2-3-4 tree?

0 Answers

For more Data Structures Interview Questions Click Here