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
6006 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 right-skewed binary tree?

0 Answers

What are the five examples of data?

0 Answers

Are lists mutable?

0 Answers

Name few concurrent collection classes?

0 Answers

Questions related to arrays, such as given a 2 integer array, find the common elements.

0 Answers Expedia,

Can list contain null values?

0 Answers

Can array store heterogeneous data?

0 Answers

What is the heap in data structures?

0 Answers

What are the different types of data type?

0 Answers

Define an algorithm. What are the properties of an algorithm? What are the types of algorithms?

0 Answers

What is array simple?

0 Answers

Differentiate between collection and collections.

0 Answers

For more Data Structures Interview Questions Click Here