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
- 5319 Views
- I also Faced
- E-Mail Answers
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 |
What is the maximum total number of nodes in a tree that has N levels? Note that the root is level (zero)
18 Answers CSC, National Instruments, Sasken, Sybrant Technologies,
Can we give size to arraylist?
Mention some drawbacks of the linked list.
input function and output function in c language
Can we store primitives in collections?
What is the Role of push() and pop() method?
How memory is reserved using a declaration statement in data structure?
Which type of efficient data structure is used in the internal storage representation in RDBMS?
What is data structure and its operations?
How many different trees are possible with 10 nodes ?
What are the two traversal strategies used in traversing a graph?
How do you sort an arraylist in descending order?
Windows 
