Design and Analysis of Algorithm

12345678910
Across
  1. 2. DS represented as essential complete BT
  2. 4. empty queue,what is the condition called?
  3. 5. collection of tress?
  4. 7. algorithm to find single source shortest path
  5. 10. algorithm to find transitive closure matrix
Down
  1. 1. collection of related, similar or dissimilar
  2. 3. with negative edge weights.
  3. 6. data structure is used to perform recursion
  4. 8. all pair shortest path problem
  5. 9. Data structure used in DFS