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
- 5362 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 is selection in an algorithm?
Does linked list allow null values?
What type of variable is age?
What is arraylist load factor?
How will you explain circular linked list?
What is binary search in programming?
Explain the term binding time?
How do you clear a stack?
What is a weighted graph?
How do you perform a merge sort?
What is the advantage of circular linked list?
What are the tasks performed during inorder traversal?
Windows 
