Graph (Data Structure and Algorithms)

12345678
Across
  1. 5. a data structure set up as two-dimensional arrays or grid that shows whether there is an edge between each pair of nodes
  2. 6. the graph where the relationship between two vertices is one-way
  3. 7. Depth First Search can be implemented by using -------
  4. 8. a node that does not have any other node beneath it
Down
  1. 1. Breadth-First Search can be implemented by using -------
  2. 2. the graph where the relationship between two vertices is two-way
  3. 3. non-linear data structures represent the relationship among data elements, having more than one predecessor and/or successor
  4. 4. algorithm starts from one vertex and grows the rest of the tree by adding one vertex at a time, by adding the associated edges