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.
- 3 Answers
- 5051 Views
- I also Faced
- E-Mail Answers
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
Is list a data structure?
Explain the uses of binary tree.
Which data structure is used in arraylist?
What is scalar example?
Can treeset contain duplicates?
How to sequentially represent max-heap?
Which sorting is best and why?
What is tree in computer science?
Differentiate linear from non linear data structure?
What is difference between capacity and size of arraylist?
Calculate the efficiency of sequential search?
What is the best case complexity of bubble sort?
What is a Queue? Explain its operation with example?
What is the height of an empty tree?
Which is best array or linked list?
