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
- 4832 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
Why is map not a collection?
What is queue in data structure?
What are types of Collision Resolution Techniques and the methods used in each of the types?
Which programming language is best for data structures?
why boundary tag representation is used?
What does the dummy header in linked list contain?
What happens in insertion sort?
Which sort is stable?
What is collections singletonlist?
Can treeset contain duplicates?
Which is better hashmap or treemap?
How memory is reserved using a declaration statement ?
Can we sort hashmap?
Describe the height term in a tree.
What is list data structure?
