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
- 4863 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 I sort hashset?
What is stable sort example?
How do you use merge sort?
Write the c program to insert a node in circular singly list at the beginning.
Why do we use dynamic arrays?
Define a tree?
What are scalar values?
What are data structures in programming?
Will it create any problem if we add elements with key as user defined object into the treemap?
Write a program to reverse a link list.
For searches. Which one is most preferred: array list or linked list?
What are the tasks performed during inorder traversal?
Write a program to sum values of given array.
How to find 3rd element from end in a linked list in one pass?
What does simulation of queues mean?
