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
- 6036 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
Define probing?
Differentiate between push and pop?
Is vector synchronized?
How do you sort an arraylist in descending order?
Explain the Complete structure of hashmap along with the basic coding of the hashmap internal implementation.
Can you distinguish between ArrayList and Array?
Differentiate between hashset and treeset.
Can you sort a string?
What does abstract data type mean?
What is dequeue operation?
What is a static structure?
What is the difference between data type and data structure?
How to reverse a linked list iterative algorithm?
What is sorting in data structure?
How to find the missing element in integer array of 1 to 7?
