Design and Analysis of Algorithm

1234567891011
Across
  1. 3. Searching method start at beginning of the
  2. 5. Data structure represented as essential complete binary tree?
  3. 6. collection of tress?
  4. 9. algorithm to find single source shortest path problem with negative edge weights.
  5. 10. data structure is used to perform recursion
  6. 11. and check one by one element
Down
  1. 1. collection of related, similar or dissimilar
  2. 2. pop() operation is called on an empty queue,
  3. 4. is the condition called?
  4. 7. all pair shortest path problem
  5. 8. algorithm to find transitive closure matrix