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
- 5821 Views
- I also Faced
- E-Mail Answers
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
Calculate the address of a random element present in a 2d array, given base address as ba.
How do you do a mergesort?
Define in brief an array.
What is link list in data structure?
By Which algorithm, the 8 queens problem is solved?
Tell me what is quick sort?
What is array simple?
Explain the difference between a list and array.
What is the difference between hashset and hashmap?
What is an recursive algorithm?
Differentiate between push and pop?
What do you understand by stable sort?
How does variable declaration affect memory allocation?
What is array define its types?
Which sorting algorithms are in place?
