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
- 5888 Views
- I also Faced
- E-Mail Answers
Answer Posted / vinoth kumar.r
To my understanding of the question it sounds like
topological sort
| Is This Answer Correct ? | 3 Yes | 2 No |
Post New Answer View All Answers
Define leaves?
What is data type in data structure?
Which is best array or linked list?
Can we search the data in a linked list?
How to traverse data in a linked list in forward and backward direction, write the algorithm?
What is the use of space complexity and time complexity?
Can we store null in arraylist?
Can hashmap have duplicate keys?
Can a hashset contain duplicates?
Explain the types of linked lists.
Write the algorithm for converting infix expression to postfix expression?
How do you sort large data?
How does bogo sort work?
Which is the parent class of abstractsequentiallist class?
Define a full binary tree ?
