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
- 5102 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
To my understanding of the question it sounds like
topological sort
| Is This Answer Correct ? | 3 Yes | 2 No |
Why arraylist is not efficient for manipulation?
What is difference between list and array list?
What are the average and worst time complexity in a sorted binary tree is
Is array static or dynamic?
What is sequential search? What is the average number of comparisons in a sequential search?
What is a treemap used for?
Where will be the free node available while inserting a new node in a linked list?
What is the easiest sorting method to use in data structures?
What is array simple?
What is the difference between hashmap and arraylist?
Describe the height term in a tree.
What is the non linear data structure?
Windows 
