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.
Answers were Sorted based on User's Feedback
To my understanding of the question it sounds like
topological sort
Is This Answer Correct ? | 3 Yes | 2 No |
Is treemap synchronized?
Write a Binary Search program
Which sorting is best in time complexity?
What is sort in data structure?
Can we store primitives in collections?
What do you mean by union-by-weight?
how to insert a new node in linked list where free node will be available?
Define dynamic data structures?
What is the average number of comparisons needed in a sequential search to determine the position of an element in an array of 100 elements, if the elements are ordered from largest to smallest?
19 Answers ABB, SDE,
Why is data structure important?
What are the types of Collision Resolution Techniques and the methods used in each of the type?
Explain the priority queue?