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
- 6034 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
To my understanding of the question it sounds like
topological sort
| Is This Answer Correct ? | 3 Yes | 2 No |
What are the advantages of linked list over an array?
Why it is said that searching a node in a binary search tree is efficient than that of a simple binary tree?
How to check array contains value or not?
Is treemap synchronized?
Is hashmap ordered?
Explain what is B-tree?
How do you do a mergesort?
What is circular queue in data structure?
If I try to add enum constants to a treeset, what sorting order will it use?
List the limitations of linear probing?
difference between the run time polymorphism and compile time poly morphism and about virtual function.
2 Answers CybAge, Innowe, TCS, Wipro,
Can hashmap be sorted?
Windows 
