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
- 6005 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 biconnectivity?
What is bubble sort with example?
Can you dynamically allocate arrays in expanded memory?
How will you free the memory that is allocated at run time?
What are the different types of data structures explain briefly?
What is a stable algorithm?
What is m way tree in data structure?
What is time complexity of binary search?
What is a minimum spanning tree?
Tell me do array subscripts always start with zero?
What is bubble sort?
Why is hashset used?
Differentiate bfs and dfs?
What is the types of data structure?
What is array in data structure with example?
