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
- 5103 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
What is difference between data type and data structure?
What are the disadvantages of circular list?
Define the queue data structure.
Is quicksort faster than merge sort?
Can we store primitives in collections?
Why sorting is done?
What are the basic data structures?
State the difference between queues and linked lists?
How to get largest and smallest number in an array?
What is collision in data structure?
How can we delete any specific node from the linked list?
What are the disadvantages array implementations of linked list?
What is a treemap chart?
What are stacks? Give some of its applications.
Is quicksort recursive?
