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
- 6010 Views
- I also Faced
- E-Mail Answers
Answer Posted / sriram
i think it is dfs algo......
| Is This Answer Correct ? | 8 Yes | 2 No |
Post New Answer View All Answers
Mention the data structures which are used in graph implementation.
Is array a data type?
Traverse the given tree using Inorder, Preorder and Postorder traversals. Inorder : D H B E A F C I G J Preorder: A B D H E C F G I J Postorder: H D E B F I J G C A
Write an algorithm that counts number of nodes in the circular linked list
What is the limit of arraylist?
What are the advantages of array?
Why do we use a multidimensional array in data structure?
How does a dynamic array work?
What is breadth first tree?
Which is the parent class of abstractqueue class?
What is the meaning of anonymous array? Explain with an example?
What is the difference between hashset and hashmap?
How treemap orders the elements if the key is a string?
Which sorting algorithm is considered the fastest?
What is example of data?
