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.
Answer Posted / vinoth kumar.r
To my understanding of the question it sounds like
topological sort
| Is This Answer Correct ? | 3 Yes | 2 No |
Post New Answer View All Answers
Write the disadvantages of separate chaining?
How to show internal storage representation of data structure in RDBM?
Explain heapsort. What is its complexity?
What is binary tree used for?
What is the idea behind splaying?
How can you represent a linked list node?
How do you represent a linked list?
What do you mean by free pool?
What is Doubly link list?
What is the time complexity of arraylist and linked list?
Why do we use insertion sort?
Why hashtable is faster than arraylist?
What's difference between stack and queue?
How to reference all the elements in a one-dimension array?
Is binary tree a binary search tree?