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
- 4860 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
How many passes does bubble sort need?
What is the difference between Array and Arraylist?
What is a 2 dimensional array?
What is the difference between for and foreach loop?
What is the time complexity of arrays sort?
How will you represent a linked list in a graphical view?
What are the main differences between the linked list and linear array?
What are vectors used for in real life?
Why do we need to use computers to help us sort lists?
Can we sort hashmap?
What does the dummy header in the linked list contain?
What's the difference between a hashtable and a hashmap?
What do you know about traversal in linked lists?
Can arraylist hold different types?
What is faster array or arraylist?
