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
- 4831 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
What is space complexity of a program?
What is sorting in math?
What are the properties of an algorithm?
Define hash table?
How can someone display singly linked list from first to last?
What is an acyclic graph?
State the difference between arrays and linked lists?
Define a full binary tree ?
What is arraylist load factor?
How do I sort hashset?
What is a hash index?
Explain what are the types of collision resolution techniques and the methods used in each of the type?
Define internal nodes?
Is boolean a data type?
How arraylist increase its size?
