Interested to Buy Any Domain ? << Click Here >> for more details...
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
- 5820 Views
- I also Faced
- E-Mail Answers
Answer Posted / sriram
i think it is dfs algo......
| Is This Answer Correct ? | 8 Yes | 2 No |
Post New Answer View All Answers
How do you increase the capacity of an arraylist?
Which is the parent class of linkedlist class?
Write an algorithm through which the inserting and deleting of elements can take place in circular queue?
What is reduction to sorting method?
Can you please explain the difference between array_name and &array_name?
Explain circular linked list?
What is sorting in data structure?
Why we use linked list?
What is array traversing?
How will you represent a linked list in a graphical view?
What are the best data structure courses for gate preparation?
List the area of applications of data structure.
What is difference between hashmap and treemap?
What is the difference between collections class vs collections interface?
How do you find the second largest element in an array of integers?
