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
- 5887 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
What is the difference between an array and vector?
What is the minimization factor and time complexity of b-tree?
Is hashmap a data structure?
Which interfaces are implemented by printerstatereasons?
Mention a few applications of linked lists?
Define circular list?
Is quicksort a stable algorithm?
What do you mean by an Array?
Does treemap allow null keys?
Explain what are the major data structures used in the network data model?
What is the difference between the hash table and hash map?
How will you reverse Linked List.
What is linear and non linear structure?
Describe linear probing with an example.
How does the size of arraylist increases dynamically?
