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
- 4864 Views
- I also Faced
- E-Mail Answers
Answer Posted / achintya singhal
BFS
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
How to reverse a linked list iterative algorithm?
How do you reference all the elements in a one-dimension array?
Is json a data structure?
What is the difference between Strings and Arrays?
What is the best complexity of bubble sort?
Define hash table?
What is Insertion sort, selection sort, bubble sort( basic differences among the functionality of the three sorts and not the exact algorithms)?
State the merits of linear representation of binary trees?
What are the disadvantages of representing a stack or queue by a linked list?
Can we search the data in a linked list?
If you are using c language to implement the heterogeneous linked list, explain what pointer type will you use?
How do you declare An array of three pointers to chars
Are sets sorted?
Is treemap thread safe?
What is the best data structure and algorithm to implement cache?
