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
- 4846 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 stacks? Give some of its applications.
Which sorting algorithm has minimum number of swaps?
What package is arraylist?
Write the disadvantages of separate chaining?
State the advantages of using postfix notations?
What is the impact of signed numbers on the memory?
Difference between calloc and malloc in data structures?
Which type of memory allocation is referred for linked list?
What is variable size arrays?and why we use it?
What are the advantages of sorting?
Define leaves?
Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
Windows 
