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
- 6021 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
What is unmodifiable list?
What is an ordered map?
Why linked list is required?
What is comparator interface used for?
In Data Structure, write output of given program.
Can hashmap have same key?
Is any implicit arguments are passed to a function when it is called?
What is difference between data type and data structure?
What are the advantages of sorting?
What are the properties of binary tree?
What do you mean by tree edge?
How to check array contains value or not?
Define terminal nodes in a tree?
What is the best case complexity of quicksort?
What is priority queue in data structure?
